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