On the Hardness of Sequence Alignment on De Bruijn Graphs.

approximate pattern matching computational complexity de Bruijn graphs sequence alignment

Journal

Journal of computational biology : a journal of computational molecular cell biology
ISSN: 1557-8666
Titre abrégé: J Comput Biol
Pays: United States
ID NLM: 9433358

Informations de publication

Date de publication:
12 2022
Historique:
pubmed: 1 12 2022
medline: 21 12 2022
entrez: 30 11 2022
Statut: ppublish

Résumé

The problem of aligning a sequence to a walk in a labeled graph is of fundamental importance to Computational Biology. For an arbitrary graph

Identifiants

pubmed: 36450127
doi: 10.1089/cmb.2022.0411
doi:

Types de publication

Journal Article Research Support, U.S. Gov't, Non-P.H.S.

Langues

eng

Sous-ensembles de citation

IM

Pagination

1377-1396

Auteurs

Daniel Gibney (D)

School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, Georgia, USA.

Sharma V Thankachan (SV)

Department of Computer Science, North Carolina State University, Raleigh, North Carolina, USA.

Srinivas Aluru (S)

School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, Georgia, USA.

Articles similaires

Genome, Chloroplast Phylogeny Genetic Markers Base Composition High-Throughput Nucleotide Sequencing

Selecting optimal software code descriptors-The case of Java.

Yegor Bugayenko, Zamira Kholmatova, Artem Kruglov et al.
1.00
Software Algorithms Programming Languages
Coal Metagenome Phylogeny Bacteria Genome, Bacterial

Classifications MeSH