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