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