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