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