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
基金
芬兰科学院;
关键词
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 条
  • [1] Finding maximal exact matches in graphs
    Rizzo, Nicola
    Caceres, Manuel
    Makinen, Veli
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2024, 19 (01)
  • [2] Finding maximal exact matches in graphs
    Nicola Rizzo
    Manuel Cáceres
    Veli Mäkinen
    Algorithms for Molecular Biology, 19
  • [3] Extracting Maximal Exact Matches on GPU
    Abu-Doleh, Anas
    Kaya, Kamer
    Abouelhoda, Mohamed
    Catalyurek, Umit V.
    PROCEEDINGS OF 2014 IEEE INTERNATIONAL PARALLEL & DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2014, : 1418 - 1427
  • [4] MONI: A Pangenomic Index for Finding Maximal Exact Matches
    Rossi, Massimiliano
    Oliva, Marco
    Langmead, Ben
    Gagie, Travis
    Boucher, Christina
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2022, 29 (02) : 169 - 187
  • [5] Faster Maximal Exact Matches with Lazy LCP Evaluation
    Goga, Adrian
    Depuydt, Lore
    Brown, Nathaniel K.
    Fostier, Jan
    Gagie, Travis
    Navarro, Gonzalo
    2024 DATA COMPRESSION CONFERENCE, DCC, 2024, : 123 - 132
  • [6] Practical Distributed Computation of Maximal Exact Matches in the Cloud
    El-Din, Sondos Seif
    Aboelhoda, Mohamed
    2014 IEEE-EMBS INTERNATIONAL CONFERENCE ON BIOMEDICAL AND HEALTH INFORMATICS (BHI), 2014, : 609 - 613
  • [7] Finding Maximal Exact Matches Using the r-Index
    Rossi, Massimiliano
    Oliva, Marco
    Bonizzoni, Paola
    Langmead, Ben
    Gagie, Travis
    Boucher, Christina
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2022, 29 (02) : 188 - 194
  • [8] Pairwise alignment of nucleotide sequences using maximal exact matches
    Bayat, Arash
    Gaeta, Bruno
    Ignjatovic, Aleksandar
    Parameswaran, Sri
    BMC BIOINFORMATICS, 2019, 20 (1)
  • [9] Pairwise alignment of nucleotide sequences using maximal exact matches
    Arash Bayat
    Bruno Gaëta
    Aleksandar Ignjatovic
    Sri Parameswaran
    BMC Bioinformatics, 20
  • [10] How to Find Long Maximal Exact Matches and Ignore Short Ones
    Gagie, Travis
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2024, 2024, 14791 : 131 - 140