Approximate string matching using phase correlation

被引:0
|
作者
Alba, Alfonso [1 ]
Rodriguez-Kessler, Margarita [1 ]
Arce-Santana, Edgar R. [1 ]
Mendez, Martin O. [1 ]
机构
[1] Univ Autonoma San Luis Potosi, Fac Ciencias, San Luis Potosi 78230, Mexico
来源
2012 ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY (EMBC) | 2012年
关键词
D O I
暂无
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
A novel method for approximate string matching with applications to bioinformatics is presented in this paper. Unlike most methods in the literature, the proposed method does not depend on the computation of the edit distance between two sequences, but uses instead a similarity index obtained by applying the phase correlation method. The resulting algorithm provides a finer control over the false positive rate, allowing users to pick out relevant matchings in less time, and can be applied for both offline and online processing.
引用
收藏
页码:6309 / 6312
页数:4
相关论文
共 50 条
  • [1] Using Maximum Subarrays for Approximate String Matching
    Aygun R.S.
    Annals of Data Science, 2017, 4 (4) : 503 - 531
  • [2] Approximate string matching using a bidirectional index
    Kucherov, Gregory
    Salikhov, Kamil
    Tsur, Dekel
    THEORETICAL COMPUTER SCIENCE, 2016, 638 : 145 - 158
  • [3] Approximate string matching using factor automata
    Holub, J
    Melichar, B
    THEORETICAL COMPUTER SCIENCE, 2000, 249 (02) : 305 - 311
  • [4] Approximate String Matching Using a Bidirectional Index
    Kucherov, Gregory
    Salikhov, Kamil
    Tsur, Dekel
    COMBINATORIAL PATTERN MATCHING, CPM 2014, 2014, 8486 : 222 - 231
  • [5] APPROXIMATE STRING MATCHING
    HALL, PAV
    DOWLING, GR
    COMPUTING SURVEYS, 1980, 12 (04) : 381 - 402
  • [6] Using signature hashing for approximate string matching
    Boitsov L.M.
    Computational Mathematics and Modeling, 2002, 13 (3) : 314 - 326
  • [7] Approximate string matching using compressed suffix arrays
    Huynh, TND
    Hon, WK
    Lam, TW
    Sung, WK
    THEORETICAL COMPUTER SCIENCE, 2006, 352 (1-3) : 240 - 249
  • [8] Approximate string matching using compressed suffix arrays
    Huynh, TND
    Hon, WK
    Lam, TW
    Sung, WK
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2004, 3109 : 434 - 444
  • [9] ALGORITHMS FOR APPROXIMATE STRING MATCHING
    UKKONEN, E
    INFORMATION AND CONTROL, 1985, 64 (1-3): : 100 - 118
  • [10] A Preprocessing for Approximate String Matching
    Baba, Kensuke
    Nakatoh, Tetsuya
    Yamada, Yasuhiro
    Ikeda, Daisuke
    INFORMATICS ENGINEERING AND INFORMATION SCIENCE, PT II, 2011, 252 : 610 - +