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