Shuffling biological sequencess with motifs constraints

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.
Type de document :
Communication dans un congrès
Algorithms and Computational Methods for Biochemical and Evolutionary Networks - CompBioNets'2004, Dec 2004, Recife, Brazil. 18 p, 2004
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00099891
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:03:36
Dernière modification le : jeudi 11 janvier 2018 - 06:25:24
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 12:00:17

Fichiers

Identifiants

  • HAL Id : inria-00099891, version 1

Citation

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, 2004. 〈inria-00099891〉

Partager

Métriques

Consultations de la notice

151

Téléchargements de fichiers

48