Login
Logged in as anonymous /
My BiBiServ
/
Logout
Search
?
Navigation
Tools
Alignment
AltAVist
ClustalW
dca
Dialign
E2G
JAli
OMA
PoSSuMsearch
PoSSuMsearch2
SWIFT Suit
Evolutionary Relationships
ConCysFind
Roci
ROCOCO
Rose
SplitsTree
Genome Comparison
AGenDA
AggloIndel
CEGeD
CG-CAT
DCJ
FFGC
Gecko
GEvolutionS
GraphTeams
MGA
newdist
REPuter
SBBI
TCRProfiler
Others
acdc
AGT-SDP
AIM
BPR
Decomp
Fly_Pres
Intronserter
jPREdictor
libfid
Metrans
mkESA
mmfind
MoRAine
Phase4
PREdictor
SciBrow
TALP
Trace2PS
Unwords
Wotd
XenDB
Primer Design
genefisher2
RNA
Shapes Studio
KnotInFrame
pAliKiss
pKiss
pknotsRG
RapidShapes
RNAalishapes
RNAshapes
aCMs
GUUGle
InSilicoDicer
Locomotif
paRNAss
planACstar
RNAforester
RNAhybrid
RNAsifter
Previous Results
Framework/Cloud
Education
Dynamic Programming
ADP
Sequence Analysis
SADR
Administration
BiBiServ policies
BiBiServ Team
Impressum
license
privacy policy
Statuscodes
Wotd
Welcome
Download
References
Authors: S. Kurtz, R. Giegerich, J. Stoye
Wotd is an implementation of the ''lazy'' write-only top-down construction algorithm of suffix trees using a very space-efficient representation.
Users of Wotd are requested to cite :
Giegerich, Robert and Kurtz, Stefan and Stoye, Jens
Efficient implementation of lazy suffix trees
, Software - Practise and Experience, 2003
built on March 4 2015 (1:d0ba4790fd33)
InSilicoDicer
References
BPR
WebService Linklist
PoSSuMsearch2
SWIFT Suit
CEGeD
Intronserter
Welcome
Statuscodes
Download
aCMs
ConCysFind
PoSSuMsearch
dca
KnotInFrame
Welcome
jPREdictor
RNAalishapes
SADR
pAliKiss
RNAsifter
Dialign
privacy policy
RNAforester
planACstar
Unwords
Wotd
MGA
ClustalW
MoRAine
Wotd
GraphTeams
license
GUUGle
CG-CAT
BiBiServ Team
pKiss
JAli
Phase4
OMA
mkESA
References
Rose
GEvolutionS
SplitsTree
genefisher2
acdc
RNAshapes
mmfind
Download
REPuter
pknotsRG
RapidShapes
Trace2PS
Locomotif
Roci
AltAVist
Metrans
AGenDA
Wotd
XenDB
FFGC
AggloIndel
PREdictor
AIM
paRNAss
DCJ
RNAhybrid
ROCOCO
SBBI
Welcome
AGT-SDP
BiBiServ policies
TCRProfiler
libfid
Gecko
Previous Results
Bellman's GAP Cafe
Fly_Pres
TALP
SciBrow
ADP
newdist
Impressum
Decomp
E2G