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