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