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