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