sequence to graph alignment;
longest common subsequence;
sparse dynamic programming;
D O I:
10.1007/978-3-031-43980-3_29
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
We show how to chain maximal exact matches (MEMs) between a query string Q and a labeled directed acyclic graph (DAG) G = (V, E) to solve the longest common subsequence (LCS) problem between Q and G. We obtain our result via a new symmetric formulation of chaining in DAGs that we solve in O(m + n + k(2)|V| + |E| + kN log N) time, where m = |Q|, n is the total length of node labels, k is the minimum number of paths covering the nodes of G and N is the number of MEMs between Q and node labels, which we show encode full MEMs.
机构:
Imam Mohammad Ibn Saud Islamic Univ, Coll Sci, Dept Math & Stat, Riyadh 11623, Saudi Arabia
Ain Shams Univ, Fac Sci, Dept Math, Cairo 11566, EgyptValencia Coll, Dept Math, Orlando, FL 32832 USA