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