Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Advanced Computer Theory and Engineering, 4th (ICACTE 2011)

By
Yi Xie
Yi Xie
Search for other works by this author on:
ISBN:
9780791859933
No. of Pages:
840
Publisher:
ASME Press
Publication date:
2011

Next generation sequencing technologies typically present high-throughput, short reader and high coverage. Large amount of data greatly increases the difficulty of the genome sequence assembly. So simplifying the sequencing data before sequence assembly can effectively improve the efficiency of sequence assembly algorithm. After analyzing the types of edges in the graph, we devise a simple transitive reduction algorithm in weighted bidirected overlap graph with O(n3) in this paper. A program is designed and realized to prove the effectiveness of this algorithm.

This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal