Graph Traversal Edit Distance and Extensions

Journal of computational biology

article

Ali Ebrahimpour Boroojeny¹  Akash Shrestha¹  Ali Sharifi-Zarchi²  Suzanne Renick Gallagher¹  S. Cenk Sahinalp³  Hamidreza Chitsaz¹ 

[1] Department of Computer Science, Colorado State University;Department of Computer Engineering, Sharif University of Technology;National Cancer Institute

关键词: assembly graph;    clustering genera;    co-assembly;    de novo variation detection;    graph comparison;    graph kernel.;   

DOI  :  10.1089/cmb.2019.0511

来源: Mary Ann Liebert, Inc. Publishers

【 摘 要 】

Many problems in applied machine learning deal with graphs (also called networks), including social networks, security, web data mining, protein function prediction, and genome informatics. The kernel paradigm beautifully decouples the learning algorithm from the underlying geometric space, which renders graph kernels important for the aforementioned applications. In this article, we give a new graph kernel, which we call graph traversal edit distance (GTED). We introduce the GTED problem and give the first polynomial time algorithm for it. Informally, the GTED is the minimum edit distance between two strings formed by the edge labels of respective Eulerian traversals of the two graphs. Also, GTED is motivated by and provides the first mathematical formalism for sequence co-assembly and de novo variation detection in bioinformatics. We demonstrate that GTED admits a polynomial time algorithm using a linear program in the graph product space that is guaranteed to yield an integer solution. To the best of our knowledge, this is the first approach to this problem. We also give a linear programming relaxation algorithm for a lower bound on GTED. We use GTED as a graph kernel and evaluate it by computing the accuracy of a support vector machine (SVM) classifier on a few data sets in the literature. Our results suggest that our kernel outperforms many of the common graph kernels in the tested data sets. As a second set of experiments, we successfully cluster viral genomes using GTED on their assembly graphs obtained from de novo assembly of next-generation sequencing reads.

【 授权许可】

Unknown