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