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