Longest Common Prefixes with k-Errors and Applications-Reference-Cited by-同舟云学术

Longest Common Prefixes with k-Errors and Applications

Published:2018 Issue: Volume: Page:27-41
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Ayad Lorraine A. K.,Barton Carl,Charalampopoulos Panagiotis,Iliopoulos Costas S.,Pissis Solon P.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-00479-8_3

Reference39 articles.

1. Abboud, A., Williams, R., Yu, H.: More applications of the polynomial method to algorithm design. In: SODA, SODA 2015, pp. 218–230. Society for Industrial and Applied Mathematics (2015)

2. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discret. Algorithms 2(1), 53–86 (2004)

3. Lecture Notes in Computer Science;H Alamro,2018

4. Alzamel, M., et al.: Efficient computation of sequence mappability. In: Gagie, T., et al. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 12–26. Springer, Cham (2018)

5. Lecture Notes in Computer Science;M Alzamel,2017

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

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

2. Dynamic and Internal Longest Common Substring;Algorithmica;2020-07-15

3. Faster algorithms for 1-mappability of a sequence;Theoretical Computer Science;2020-04

4. Longest property-preserved common factor: A new string-processing framework;Theoretical Computer Science;2020-04

5. Apache Spark Implementations for String Patterns in DNA Sequences;Advances in Experimental Medicine and Biology;2020