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