Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jean-Eudes Duchesne"'
Publikováno v:
Journal of Bioinformatics and Computational Biology. :317-342
Several methods have been developed for identifying more or less complex RNA structures in a genome. All these methods are based on the search for conserved primary and secondary sub-structures. In this paper, we present a simple formal representatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c05b3ea417c8dc98b79ecec735cc3fa9
https://doi.org/10.1142/s0219720005001065
https://doi.org/10.1142/s0219720005001065
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540735441
COCOON
13th Annual International Computing and Combinatorics Conference (COCOON 2007)
13th Annual International Computing and Combinatorics Conference (COCOON 2007), Jul 2007, Banff, Canada. pp.27-39, ⟨10.1007/978-3-540-73545-8_6⟩
COCOON
13th Annual International Computing and Combinatorics Conference (COCOON 2007)
13th Annual International Computing and Combinatorics Conference (COCOON 2007), Jul 2007, Banff, Canada. pp.27-39, ⟨10.1007/978-3-540-73545-8_6⟩
International audience; Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-based heuristics have been proved very efficient
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6184136fa32436e19fb5d11586549f1
https://doi.org/10.1007/978-3-540-73545-8_6
https://doi.org/10.1007/978-3-540-73545-8_6
Publikováno v:
Journal of Bioinformatics & Computational Biology; Apr2005, Vol. 3 Issue 2, p317-342, 26p
Autor:
Guohui Lin
The Annual International Computing and Combinatorics Conference is an annual forum for exploring research, development, and novel applications of computing and combinatorics. It brings together researchers, professionals and industrial practitioners