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