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