Algorithms to reconstruct past indels: The deletion-only parsimony problem.
Ancestral sequence reconstruction is an important task in bioinformatics, with applications ranging from protein engineering to the study of genome evolution. When sequences can only undergo substitutions, optimal reconstructions can be efficiently computed using well-known algorithms. However, acco...
Saved in:
| Main Authors: | Jordan Moutet, Eric Rivals, Fabio Pardi |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2025-07-01
|
| Series: | PLoS Computational Biology |
| Online Access: | https://doi.org/10.1371/journal.pcbi.1012585 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Multi-exit Kolmogorov–Arnold networks: enhancing accuracy and parsimony
by: James Bagrow, et al.
Published: (2025-01-01) -
Solving Edges Deletion Problem of Complete Graphs
by: Anwar N. Jasim, et al.
Published: (2024-12-01) -
Sarbecovirus RBD indels and specific residues dictating multi-species ACE2 adaptiveness
by: Jun-Yu Si, et al.
Published: (2024-10-01) -
Rainfall simulation based on parsimonious calibration of a multifractal canonical disaggregation scheme in the Arno river basin, Italy
by: Francesco Cappelli, et al.
Published: (2025-06-01) -
Clade-Specific Recombination and Mutations Define the Emergence of Porcine Epidemic Diarrhea Virus S-INDEL Lineages
by: Yang-Yang Li, et al.
Published: (2025-08-01)