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