Paper Info
Title
Parallel merging method to integrate different genome assemblies
Abstract
In this paper research in the field of application multiprocessor systems for genome assemblies reconciliation has been carried out. A large number of algorithmic approaches aimed to solve the task of de novo assembly from short reads, however the results of their work on the same raw data often differ essentially. A parallel algorithm for merging two or more assemblies without relying on a reference genome is presented. Due to the large data volume the computations in the distributed memory model on computational cluster are required. The proposed method integrates a combination of draft assemblies reducing resulting contigs fragmentation. Sequential version of the algorithm is implemented in C/C++ and is available at https://bitbucket.org/kromanenkov/gar.
Year
DOI
Venue
2015
10.1109/BIBM.2015.7359891
IEEE International Conference on Bioinformatics and Biomedicine
Keywords
Field
DocType
bioinformatics, multiprocessor systems, parallel algorithms
Genome,Computer science,Parallel algorithm,Parallel computing,Distributed memory,Multiprocessing,Bioinformatics,Merge (version control),Reference genome,Sequence assembly,Computation
Conference
ISSN
Citations 
PageRank 
2156-1125
0
0.34
References 
Authors
5
1
Name
Order
Citations
PageRank
Kirill Romanenkov100.34