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