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