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