Efficient sequential and parallel algorithms for finding edit distance based motifs

被引：0
|
作者：
Soumitra Pal
Peng Xiao
Sanguthevar Rajasekaran
机构：
[1] University of Connecticut,Department of Computer Science and Engineering
[2] University of Connecticut,Department of Computer Science and Engineering
来源：
BMC Genomics | / 17卷
关键词：
Motif; Edit distance; Trie; Radix sort;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Efficient sequential and parallel algorithms for finding edit distance based motifs
    Pal, Soumitra
    Xiao, Peng
    Rajasekaran, Sanguthevar
    BMC GENOMICS, 2016, 17
  • [2] Improved Algorithms for Finding Edit Distance Based Motifs
    Pal, Soumitra
    Rajasekaran, Sanguthevar
    PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE, 2015, : 537 - 542
  • [3] EMS3: An Improved Algorithm for Finding Edit-Distance Based Motifs
    Xiao, Peng
    Cai, Xingyu
    Rajasekaran, Sanguthevar
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2021, 18 (01) : 27 - 37
  • [4] EMS3: An Improved Algorithm for Finding Edit-distance Based Motifs
    Xiao, Peng
    Cai, Xingyu
    Rajasekaran, Sanguthevar
    2018 IEEE 8TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL ADVANCES IN BIO AND MEDICAL SCIENCES (ICCABS), 2018,
  • [5] Efficient Parallel Computing of Graph Edit Distance
    Wang, Ran
    Fang, Yixiang
    Feng, Xing
    2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDEW 2019), 2019, : 233 - 240
  • [6] Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance
    Saks, Michael
    Seshadhri, C.
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1698 - 1709
  • [7] Sequential and parallel algorithms for finding a maximum convex polygon
    Fischer, P
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 7 (03): : 187 - 200
  • [8] Data compression of ECG based on the edit distance algorithms
    Morita, Hiroyoshi
    Kobayashi, Kingo
    IEICE Transactions on Information and Systems, 1993, E76-D (12) : 1443 - 1453
  • [9] Fast sequential and parallel algorithms for finding extremal sets
    Shen, H
    Evans, DJ
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1996, 61 (3-4) : 195 - 211
  • [10] SEQUENTIAL AND PARALLEL ALGORITHMS FOR FINDING MAXIMUM MATCHINGS IN GRAPHS
    GALIL, Z
    ANNUAL REVIEW OF COMPUTER SCIENCE, 1986, 1 : 197 - 224
12345