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