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