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