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