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