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