Algorithms for matching partially labelled sequence graphs

被引：0
|
作者：
William R. Taylor
机构：
[1] Francis Crick Institute,
来源：
Algorithms for Molecular Biology | / 12卷
关键词：
Phylogenetic tree matching; Correlated substitution analysis; Bipartite graph matching;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Algorithms for matching partially labelled sequence graphs
    Taylor, William R.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2017, 12
  • [2] Adaptive Matching Based Kernels for Labelled Graphs
    Woznica, Adam
    Kalousis, Alexandros
    Hilario, Melanie
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PT II, PROCEEDINGS, 2010, 6119 : 374 - 385
  • [3] Multivariate matching polynomials of cyclically labelled graphs
    McSorley, John P.
    Feinsilver, Philip
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3205 - 3218
  • [4] Matching algorithms are fast in sparse random graphs
    Bast, H
    Mehlhorn, K
    Schäfer, G
    Tamaki, H
    THEORY OF COMPUTING SYSTEMS, 2006, 39 (01) : 3 - 14
  • [5] EFFICIENT ALGORITHMS FOR FINDING MAXIMUM MATCHING IN GRAPHS
    GALIL, Z
    COMPUTING SURVEYS, 1986, 18 (01) : 23 - 38
  • [6] Scaling Algorithms for Weighted Matching in General Graphs
    Duan, Ran
    Pettie, Seth
    Su, Hsin-Hao
    ACM TRANSACTIONS ON ALGORITHMS, 2018, 14 (01)
  • [7] Multithreaded Algorithms for Maximum Matching in Bipartite Graphs
    Azad, Ariful
    Halappanavar, Mahantesh
    Rajamanickam, Sivasankaran
    Boman, Erik G.
    Khan, Arif
    Pothen, Alex
    2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2012, : 860 - 872
  • [8] Matching algorithms are fast in sparse random graphs
    Bast, H
    Mehlhorn, K
    Schäfer, G
    Tamaki, H
    STACS 2004, PROCEEDINGS, 2004, 2996 : 81 - 92
  • [9] Matching Algorithms Are Fast in Sparse Random Graphs
    Holger Bast
    Kurt Mehlhorn
    Guido Schafer
    Hisao Tamaki
    Theory of Computing Systems, 2006, 39 : 3 - 14
  • [10] EFFICIENT ALGORITHMS FOR FINDING MAXIMAL MATCHING IN GRAPHS
    GALIL, Z
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 159 : 90 - 113
12345