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