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