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)
GEvolutionS
AGenDA
Metrans
Wotd
AltAVist
libfid
planACstar
Trace2PS
mmfind
SADR
MoRAine
RapidShapes
DCJ
OMA
Bellman's GAP Cafe
Wotd
mkESA
genefisher2
ADP
privacy policy
AggloIndel
Fly_Pres
RNAsifter
Unwords
PoSSuMsearch2
RNAshapes
PoSSuMsearch
pKiss
CEGeD
paRNAss
InSilicoDicer
XenDB
SBBI
license
AIM
JAli
RNAforester
SplitsTree
Phase4
GraphTeams
SWIFT Suit
aCMs
WebService Linklist
REPuter
BPR
Intronserter
Wotd
acdc
ConCysFind
Roci
Welcome
CG-CAT
ClustalW
Statuscodes
Previous Results
TALP
PREdictor
SciBrow
E2G
Download
References
Impressum
GUUGle
Gecko
KnotInFrame
AGT-SDP
Welcome
TCRProfiler
MGA
RNAalishapes
Welcome
RNAhybrid
pknotsRG
newdist
ROCOCO
Download
Locomotif
Decomp
jPREdictor
FFGC
dca
Rose
BiBiServ policies
BiBiServ Team
pAliKiss
References
Dialign