A Study of Computational Genome Assembly by Graph Theory
The assembly of billions of short sequencing reads into a contiguous genome is a daunting task. The foundation knowledge of current DNA assembly models is concentrated among a select group, where the solution to the genome assembly challenge lies in proper ordering the genomic data. This contributio...
Saved in:
| Main Author: | Sarkar Bijan |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2024-01-01
|
| Series: | Annals of the West University of Timisoara: Mathematics and Computer Science |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/awutm-2024-0001 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Equality cases of the Alexandrov–Fenchel inequality are not in the polynomial hierarchy
by: Swee Hong Chan, et al.
Published: (2024-01-01) -
On the maximum atom-bond sum-connectivity index of molecular trees
by: Zhonglin Cheng, et al.
Published: (2024-09-01) -
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
by: Bai Yongqiang, et al.
Published: (2024-12-01) -
On the δ-chromatic numbers of the Cartesian products of graphs
by: Tangjai Wipawee, et al.
Published: (2024-11-01) -
𝕮-inverse of graphs and mixed graphs
by: Alomari Omar, et al.
Published: (2025-02-01)