An Efficient Combinatorial Approach for Solving the DNA Motif Finding Problem (Contributo in atti di convegno)

Type
Label
  • An Efficient Combinatorial Approach for Solving the DNA Motif Finding Problem (Contributo in atti di convegno) (literal)
Anno
  • 2009-01-01T00:00:00+01:00 (literal)
Alternative label
  • Geraci F.; Pellegrini M.; Renda M. E. (2009)
    An Efficient Combinatorial Approach for Solving the DNA Motif Finding Problem
    in Ninth International Conference on Intelligent Systems Design and Applications, Pisa, Italy
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Geraci F.; Pellegrini M.; Renda M. E. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • In: ISDA'09 - Ninth International Conference on Intelligent Systems Design and Applications (Pisa, Italy, November 30-December 02 2009). Proceedings, pp. 335 - 340. IEEE Computer Society, 2009. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • ABSTRACT: The detection of an over-represented sub-sequence in a set of (carefully chosen) DNA sequences is often the main clue leading to the investigation of a possible functional role for such a subsequence. Over-represented substrings (with possibly local mutations) in a biological string are termed motifs. A typical functional unit that can be modeled by a motif is a Transcription Factor Binding Site (TFBS), a portion of the DNA sequence apt to the binding of a protein that participates in complex transcriptomic biochemical reactions. In the literature it has been proposed a simplified combinatorial problem called the planted (l-d)-motif problem (known also as the (l-d) Challenge Problem) that captures the essential combinatorial nature of the motif finding problem. In this paper we propose a novel graph-based algorithm for solving a refinement of the (l-d) Challenge Problem. Experimental results show that instances of the (l-d) Challenge Problem considered difficult for competing (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • CNR-IIT, Pisa (literal)
Titolo
  • An Efficient Combinatorial Approach for Solving the DNA Motif Finding Problem (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Insieme di parole chiave di
data.CNR.it