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