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