Shuffling biological sequencess with motifs constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

Shuffling biological sequencess with motifs constraints

(1) , (2) , (3) , (3)
1
2
3

Abstract

We study the following problem : given a biological sequence S, a multiset M of motifs and an integer k, generate uniformly random sequences which contain the given motifs and have exactly the same frequencies occurrences of k-lets (i.e. factors of length k) of S. This question involves difficult problems: We notably state that the problem of deciding whether a sequence respects given motifs constraints is NP-complete. Meanwhile, we give a random generation algorithm which turns out to be experimentally efficient.
Fichier principal
Vignette du fichier
A04-R-272.pdf (214.06 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00099891 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099891 , version 1

Cite

Dominique Barth, Johanne Cohen, Alain Denise, Romain Rivière. Shuffling biological sequencess with motifs constraints. Algorithms and Computational Methods for Biochemical and Evolutionary Networks - CompBioNets'2004, Dec 2004, Recife, Brazil. 18 p. ⟨inria-00099891⟩
111 View
37 Download

Share

Gmail Facebook Twitter LinkedIn More