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