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