50 Research on Transitive Reduction Algorithm in the Weighted Bidirected Overlap Graph
Download citation file:
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.