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