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