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