Chaining of Maximal Exact Matches in Graphs

被引：3
|
作者：
Rizzo, Nicola [1 ]
Caceres, Manuel [1 ]
Makinen, Veli [1 ]
机构：
[1] Univ Helsinki, Dept Comp Sci, POB 68,Pietari Kalmin Katu 5, Helsinki 00014, Finland
来源：
STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2023 | 2023年 / 14240卷
基金：
芬兰科学院;
关键词：
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.
引用
收藏
页码：353 / 366
页数：14
相关论文
共 50 条
  • [21] A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays
    Khan, Zia
    Bloom, Joshua S.
    Kruglyak, Leonid
    Singh, Mona
    BIOINFORMATICS, 2009, 25 (13) : 1609 - 1616
  • [22] Maximal graphs and graphs with maximal spectral radius
    Olesky, DD
    Roy, A
    van den Driessche, P
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2002, 346 (1-3) : 109 - 130
  • [23] HEURISTIC CHAINING IN DIRECTED ACYCLIC GRAPHS
    VENUGOPAL, R
    SRIKANT, YN
    COMPUTER LANGUAGES, 1993, 19 (03): : 169 - 184
  • [24] Exact word matches in rice pseudomolecules
    Liu, Shaolin
    Tinker, Nicholas A.
    Mather, Diane E.
    GENOME, 2006, 49 (08) : 1047 - 1051
  • [25] Exact sequence matches in genomic studies
    Sheinman, M.
    IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENIY-PRIKLADNAYA NELINEYNAYA DINAMIKA, 2023, 31 (06): : 739 - 756
  • [26] Comparing fixed sampling with minimizer sampling when using k-mer indexes to find maximal exact matches
    Almutairy, Meznah
    Torng, Eric
    PLOS ONE, 2018, 13 (02):
  • [27] An Evolutionary Distance Based on Maximal Unique Matches
    Guyon, Frederic
    Guenoche, Alain
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2010, 39 (03) : 385 - 397
  • [28] EXACT GRAPHS
    SCHNABEL, R
    SPENGLER, U
    ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITAT HAMBURG, 1994, 64 : 15 - 31
  • [29] Co-linear chaining on pangenome graphs
    Rajput, Jyotshna
    Chandra, Ghanshyam
    Jain, Chirag
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2024, 19 (01)
  • [30] Annotating large genomes with exact word matches
    Healy, J
    Thomas, EE
    Schwartz, JT
    Wigler, M
    GENOME RESEARCH, 2003, 13 (10) : 2306 - 2315
12345