A lower bound for the breakpoint phylogeny problem
type: Item
instance of: scholarly article
title: A lower bound for the breakpoint phylogeny problem
zbMATH Open document ID: 1114.92049
DOI: 10.1016/S1570-8667(03)00077-7
author: David Bryant
published in: Journal of Discrete Algorithms
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5147094
zbMATH Keywords: gene order data
zbMATH Keywords: breakpoints
zbMATH Keywords: phylogenetics
zbMATH Keywords: lower bounds
zbMATH Keywords: Lagrange multipliers
describes a project that uses: TSPLIB
describes a project that uses: PAUP*
describes a project that uses: GRAPPA
MaRDI profile type: Publication
cites work: Q5457078
cites work: Q5457081
cites work: Transforming cabbage into turnip
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: Reducibility Among Combinatorial Problems
cites work: Q4410169
cites work: Steps toward accurate reconstructions of phylogenies from gene-order data.
cites work: Q5457094
cites work: Locating the vertices of a steiner tree in an arbitrary metric space
cites work: STEINER POINTS IN THE SPACE OF GENOME REARRANGEMENTS
cites work: Q4364593
cites work: Q5457073
full work available at URL: s1570-8667(03)00077-7
OpenAlex ID: W1973111150
description: scientific article; zbMATH DE number 5147094