Fixed-parameter algorithms for scaffold filling

The new sequencing technologies, called next-generation sequencing, provide a huge amount of data that can be used to reconstruct genomes. However, the methods applied to reconstruct genomes often are not able to reconstruct a complete genome and provide only an incomplete information. Here we consi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 568; s. 72 - 83
Hlavní autoři: Bulteau, Laurent, Carrieri, Anna Paola, Dondi, Riccardo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.02.2015
Elsevier
Témata:
Algorithms
Bioinformatics
Collection
Combinatorial analysis
Complexity
Computational biology
Computer Science
Data Structures and Algorithms
Fixed-parameter algorithms
Gene sequencing
Genes
Genome comparison
Genomes
Insertion
Scaffold filling
Scaffolds
Fixed-parameter algorithms
Scaffold filling
Genome comparison
Computational biology
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The new sequencing technologies, called next-generation sequencing, provide a huge amount of data that can be used to reconstruct genomes. However, the methods applied to reconstruct genomes often are not able to reconstruct a complete genome and provide only an incomplete information. Here we consider two combinatorial problems that aim to reconstruct complete genomes by inserting a collection of missing genes. The first problem we consider, called One-sided scaffold filling, given an incomplete genome B and a complete genome A, asks for the insertion of missing genes into an incomplete genome B with the goal of maximizing the common adjacencies between genomes B′ (resulting from the insertion of missing genes in B) and A. The second problem, called Two-sided scaffold filling, given two incomplete genomes A, B, asks for the insertion of missing genes into both genomes so that the resulting genomes A′ and B′ have the same multiset of genes and the number of common adjacencies between A′ and B′ is maximized. Both problems were proved to be NP-hard, while their parameterized complexity, when the parameter is the number of common adjacencies of the resulting genomes, was left as an open problem. In this paper, we settle this open problem by presenting fixed-parameter algorithms for One-sided scaffold filling and Two-sided scaffold filling.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2014.12.005