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