Efficient Computation of Sequence Mappability-Reference-Cited by-同舟云学术

Efficient Computation of Sequence Mappability

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

Author:

Alzamel Mai^ORCID,Charalampopoulos Panagiotis^ORCID,Iliopoulos Costas S.^ORCID,Kociumaka Tomasz^ORCID,Pissis Solon P.^ORCID,Radoszewski Jakub^ORCID,Straszyński Juliusz^ORCID

Publisher

Springer International Publishing

Link

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

Reference21 articles.

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

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

3. Antoniou, P., Daykin, J.W., Iliopoulos, C.S., Kourie, D., Mouchard, L., Pissis, S.P.: Mapping uniquely occurring short sequences derived from high throughput technologies to a reference genome. In: Information Technology and Applications in Biomedicine, ITAB 2009. IEEE (2009). https://doi.org/10.1109/itab.2009.5394394

4. Ayad, L.A.K., Barton, C., Charalampopoulos, P., Iliopoulos, C.S., Pissis, S.P.: Longest common prefixes with $$k$$-errors and applications. In: Gagie, T., et al. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 27–41. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00479-8_3

5. Charalampopoulos, P., et al.: Linear-time algorithm for long LCF with $$k$$ mismatches. In: Navarro, G., Sankoff, D., Zhu, B. (eds.) Combinatorial Pattern Matching, CPM 2018. LIPIcs, vol. 105, pp. 23:1–23:16. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2018). https://doi.org/10.4230/LIPIcs.CPM.2018.23

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

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

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

3. Longest Common Prefixes with k-Errors and Applications;String Processing and Information Retrieval;2018