NDLI: Investigating the complexity of the double distance problems

Content Provider	Springer Nature : BioMed Central
Author	Braga, Marília D. V. Brockmann, Leonie R. Klerx, Katharina Stoye, Jens
Abstract	Two genomes $\mathbb {A}$ and $\mathbb {B}$ over the same set of gene families form a canonical pair when each of them has exactly one gene from each family. Denote by $n_$ the number of common families of $\mathbb {A}$ and $\mathbb {B}$ . Different distances of canonical genomes can be derived from a structure called breakpoint graph, which represents the relation between the two given genomes as a collection of cycles of even length and paths. Let $c_i$ and $p_j$ be respectively the numbers of cycles of length i and of paths of length j in the breakpoint graph of genomes $\mathbb {A}$ and $\mathbb {B}$ . Then, the breakpoint distance of $\mathbb {A}$ and $\mathbb {B}$ is equal to $n_-\left( c_2+\frac{p_0}{2}\right)$ . Similarly, when the considered rearrangements are those modeled by the double-cut-and-join (DCJ) operation, the rearrangement distance of $\mathbb {A}$ and $\mathbb {B}$ is $n_-\left( c+\frac{p_e }{2}\right)$ , where c is the total number of cycles and $p_e$ is the total number of paths of even length. The distance formulation is a basic unit for several other combinatorial problems related to genome evolution and ancestral reconstruction, such as median or double distance. Interestingly, both median and double distance problems can be solved in polynomial time for the breakpoint distance, while they are NP-hard for the rearrangement distance. One way of exploring the complexity space between these two extremes is to consider a $\sigma _k$ distance, defined to be $n_-\left( c_2+c_4+\ldots +c_k+\frac{p_0+p_2+\ldots +p_{k-2}}{2}\right)$ , and increasingly investigate the complexities of median and double distance for the $\sigma _4$ distance, then the $\sigma _6$ distance, and so on. While for the median much effort was done in our and in other research groups but no progress was obtained even for the $\sigma _4$ distance, for solving the double distance under $\sigma _4$ and $\sigma _6$ distances we could devise linear time algorithms, which we present here.
Related Links	https://almob.biomedcentral.com/counter/pdf/10.1186/s13015-023-00246-y.pdf
Ending Page	20
Page Count	20
Starting Page	1
File Format	HTM / HTML
ISSN	17487188
DOI	10.1186/s13015-023-00246-y
Journal	Algorithms for Molecular Biology
Issue Number	1
Volume Number	19
Language	English
Publisher	BioMed Central
Publisher Date	2024-01-04
Access Restriction	Open
Subject Keyword	Bioinformatics Computational Biology Physiological Cellular and Medical Topics Algorithms Comparative genomics Genome rearrangement Breakpoint distance Double-cut-and-join (DCJ) distance Double distance Computational Biology/Bioinformatics
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Molecular Biology Computational Theory and Mathematics Structural Biology
Journal Impact Factor	1.5/2023
5-Year Journal Impact Factor	1.3/2023

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A general framework for genome rearrangement with biological constraints

Approximating the DCJ distance of balanced genomes in linear time

Recombinations, chains and caps: resolving problems with the DCJ-indel model

DCJ-indel and DCJ-substitution distances with distinct operation costs

Natural family-free genomic distance

Models and algorithms for genome rearrangement with positional constraints

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes

On the family-free DCJ distance and similarity

New algorithms for structure informed genome rearrangement

Investigating the complexity of the double distance problems

Similar Documents

A general framework for genome rearrangement with biological constraints

Approximating the DCJ distance of balanced genomes in linear time

Recombinations, chains and caps: resolving problems with the DCJ-indel model

DCJ-indel and DCJ-substitution distances with distinct operation costs

Natural family-free genomic distance

Models and algorithms for genome rearrangement with positional constraints

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes

On the family-free DCJ distance and similarity

New algorithms for structure informed genome rearrangement

Investigating the complexity of the double distance problems