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