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