|
|||||||||||||||
DOI: 10.1051/ita:2001132
Theoret. Informatics Appl. 35, 565-577 (2001)
Forbidden Factors and Fragment Assembly
F. Mignosi, A. Restivo and M. SciortinoUniversity of Palermo, Dipartimento di Matematica ed Applicazioni, Via Archirafi 34, 90123 Palermo, Italy; mignosi@math.unipa.it.restivo@math.unipa.it.mari@math.unipa.it.
(Received June 26, 2001. Revised February 21, 2002.)
Abstract
In this paper methods and results related to the notion of minimal
forbidden words are applied to the fragment assembly problem. The
fragment assembly problem can be formulated, in its simplest form,
as follows: reconstruct a word
w from a given set
I of
substrings (fragments) of a word
w. We introduce an
hypothesis involving the set of fragments
I and the maximal
length
m(w) of the minimal forbidden factors of
w. Such
hypothesis allows us to reconstruct uniquely the word
w from the
set
I in linear time. We prove also that, if
w is a word
randomly generated by a memoryless source with identical symbol
probabilities,
m(w) is logarithmic with respect to the size of
w. This result shows that our reconstruction algorithm is suited
to approach the above problem in several practical applications
e.g. in the case of DNA sequences.
Mathematics Subject Classification. 68Q45, 68R15.
Key words: Factor automaton -- minimal forbidden factor -- fragment assembly.
© EDP Sciences 2001
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook