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