Theoretical Analysis of Sequencing Bioinformatics Algorithms and Beyond-Reference-Cited by-同舟云学术

Theoretical Analysis of Sequencing Bioinformatics Algorithms and Beyond

Published:2023-06-22 Issue:7 Volume:66 Page:118-125
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Medvedev Paul¹

Affiliation:

1. Pennsylvania State University, University Park, PA, USA

Abstract

A case study reveals the theoretical analysis of algorithms is not always as helpful as standard dogma might suggest.

Funder

National Institute of General Medical Sciences

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3571723

Reference53 articles.

1. Rainbowfish: A succinct colored de Bruijn graph representation;Almodaresi F.;Proceedings in Informatics Algorithms in Bioinformatics,2017

2. A space and time-efficient index for the compacted colored de Bruijn graph

3. SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing

4. Bowe , A. , Onodera , T. , Sadakane , K. , and Shibuya , T . Succinct de Bruijn graphs. WABI 7534 LNCS . Springer , 2012 , 225--235. Bowe, A., Onodera, T., Sadakane, K., and Shibuya, T. Succinct de Bruijn graphs. WABI 7534 LNCS. Springer, 2012, 225--235.

5. GAML: genome assembly by maximum likelihood

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

1. SAMA: a contig assembler with correctness guarantee;2024-07-14

2. PLA-complexity ofk-mer multisets;2024-02-11

3. Exact global alignment using A* with chaining seed heuristic and match pruning;Bioinformatics;2024-01-23