Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis-Reference-Cited by-同舟云学术

Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis

Published:2018 Issue: Volume: Page:211-224
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Thankachan Sharma V.,Aluru Chaitanya,Chockalingam Sriram P.,Aluru Srinivas

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-89929-9_14

Reference31 articles.

1. Abboud, A., Williams, R., Yu, H.: More applications of the polynomial method to algorithm design. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 218–230 (2015)

2. Lecture Notes in Computer Science;A Abboud,2014

3. Lecture Notes in Computer Science;S Aluru,2015

4. Lecture Notes in Computer Science;A Apostolico,2010

5. Apostolico, A., Guerra, C., Landau, G.M., Pizzi, C.: Sequence similarity measures based on bounded hamming distance. Theoret. Comput. Sci. 638, 76–90 (2016)

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Computation of Sequence Mappability;Algorithmica;2022-02-02

2. An alignment-free heuristic for fast sequence comparisons with applications to phylogeny reconstruction;BMC Bioinformatics;2020-11

3. Efficient Data Structures for Range Shortest Unique Substring Queries;Algorithms;2020-10-30

4. Sequential and parallel algorithms for all-pair k-mismatch maximal common substrings;Journal of Parallel and Distributed Computing;2020-10

5. A Survey on Shortest Unique Substring Queries;Algorithms;2020-09-06