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