libFLASM: a software library for fixed-length approximate string matching

被引：0
|
作者：
Lorraine A. K. Ayad
Solon P. Pissis
Ahmad Retha
机构：
[1] King’s College London,Department of Informatics
来源：
BMC Bioinformatics | / 17卷
关键词：
Approximate string matching; Fixed-length approximate string matching; Dynamic programming; Software library;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] libFLASM: a software library for fixed-length approximate string matching
    Ayad, Lorraine A. K.
    Pissis, Solon P.
    Retha, Ahmad
    BMC BIOINFORMATICS, 2016, 17
  • [2] Correction to: New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance
    ThienLuan Ho
    Seung-Rohk Oh
    HyunJin Kim
    The Journal of Supercomputing, 2018, 74 : 1835 - 1835
  • [3] Generalised Implementation for Fixed-Length Approximate String Matching under Hamming Distance & Applications
    Pissis, Solon P.
    Retha, Ahmad
    2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, 2015, : 367 - 374
  • [4] A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
    Crochemore, Maxime
    Iliopoulos, Costas S.
    Pissis, Solon P.
    ALGORITHMS AND APPLICATIONS: ESSAYS DEDICATED TO ESKO UKKONEN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2010, 6060 : 92 - 101
  • [5] A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies
    Iliopoulos, Costas S.
    Mouchard, Laurent
    Pissis, Solon P.
    PARALLEL COMPUTING: FROM MULTICORES AND GPU'S TO PETASCALE, 2010, 19 : 150 - 157
  • [6] New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance (vol 74, pg 1815, 2018)
    Ho, ThienLuan
    Oh, Seung-Rohk
    Kim, HyunJin
    JOURNAL OF SUPERCOMPUTING, 2018, 74 (05): : 1835 - 1835
  • [7] Fixed-length String Compression for Direct Operations in Column-oriented Databases
    KeYan
    Xie, Meiyi
    Zhu, Hong
    2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 1171 - 1176
  • [8] IFViT: Interpretable Fixed-Length Representation for Fingerprint Matching via Vision Transformer
    Qiu, Yuhang
    Chen, Honghui
    Dong, Xingbo
    Lin, Zheng
    Yi Liao, Iman
    Tistarelli, Massimo
    Jin, Zhe
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2025, 20 : 559 - 573
  • [9] Incremental Maintenance of Length Normalized Indexes for Approximate String Matching
    Hadjieleftheriou, Marios
    Koudas, Nick
    Srivastava, Divesh
    ACM SIGMOD/PODS 2009 CONFERENCE, 2009, : 429 - 440
  • [10] On the Number of Fixed-Length Semiorders
    Hu, Yangzhou
    JOURNAL OF INTEGER SEQUENCES, 2014, 17 (01)
12345