On the Complexity of Rearrangement Problems Under the Breakpoint Distance

Journal of Computational Biology- United States

doi 10.1089/cmb.2013.0004

Full Text

Abstract

Available in

Date

Authors

Publisher

Mary Ann Liebert Inc

Related search

On the Distribution of Cycles and Paths in Multichromosomal Breakpoint Graphs and the Expected Value of Rearrangement Distance

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2015English

Multiple Genome Rearrangement and Breakpoint Phylogeny

Journal of Computational Biology
GeneticsMolecular BiologyComputational TheorySimulationComputational MathematicsMathematicsModeling
1998English

Breakpoint Distance and PQ-trees

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2020English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On the Computational Complexity of Matrix Semigroup Problems

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

On the Complexity of Some Common Geometric Location Problems

SIAM Journal on Computing
MathematicsComputer Science
1984English

On the Complexity of Undecidable Problems in Automata Theory

1967English

On the Complexity of Shortest Path Problems on Discounted Cost Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

The Complexity of Design Automation Problems

1988English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy