|
Title:
|
OVERLAP GRAPH SIMPLIFICATION USING EDGE RELIABILITY CALCULATION |
|
Author(s):
|
Sergey Kazakov, Anatoly Shalyto |
|
ISBN:
|
978-989-8704-10-8 |
|
Editors:
|
Ajith P. Abraham, Antonio Palma dos Reis and Jörg Roth |
|
Year:
|
2014 |
|
Edition:
|
Single |
|
Keywords:
|
Overlap Graph, de novo Genome Assembly, Bioinformatics |
|
Type:
|
Short Paper |
|
First Page:
|
222 |
|
Last Page:
|
226 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
One of the problems in genome assembly is overlap graph complexity. Despite the existence of many overlap graph simplification methods, it is still tangled after applying many of them. A novel approach to solve this problem is presented. The proposed algorithm uses several types of information about edges in the overlap graph to simplify it. We define a reliability measure of an edge based on this information. The method has been tested on three bacteria with different characteristics; the results show the applicability and efficiency of the suggested approach. |
|
|
|
|
|
|
