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