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