Amanote Research

Amanote Research

    RegisterSign In

Efficient Algorithms for Multichromosomal Genome Rearrangements

Journal of Computer and System Sciences - United States
doi 10.1016/s0022-0000(02)00011-9
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
Date

November 1, 2002

Authors
Glenn Tesler
Publisher

Elsevier BV


Related search

Efficient Algorithms for Detecting Genetic Interactions in Genome-Wide Association Study

2012English

UDiTaS™, a Genome Editing Detection Method for Indels and Genome Rearrangements

BMC Genomics
BiotechnologyGenetics
2018English

Efficient Algorithms for Sequence Segmentation

2006English

Efficient Algorithms for Sequence Analysis

1993English

Efficient Algorithms for Hirshfeld-I Charges

Journal of Chemical Physics
MedicineTheoretical ChemistryAstronomyPhysicsPhysical
2015English

Efficient Algorithms for Processing XPath Queries

ACM Transactions on Database Systems
Information Systems
2005English

Efficient Algorithms for Approximating Polygonal Chains

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2000English

Efficient Algorithms for Singleton Arc Consistency

Constraints
CombinatoricsMathematicsDiscrete MathematicsComputational TheoryArtificial IntelligenceSoftware
2009English

Programmed Genome Rearrangements in the Ciliate Oxytricha

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy