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