#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1969

2017

- This year (2)
- Last 5 years (16)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Roland Wittler, Ján Manuch, Murray Patterson, Jens Stoye
- Journal of Computational Biology
- 2010

In comparative genomics, differences or similarities of gene orders are determined to predict functional relations of genes or phylogenetic relations of genomes. For this purpose, various combinatorial models can be used to specify gene clusters--groups of genes that are co-located in a set of genomes. Several approaches have been proposed to reconstruct… (More)

- Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta
- IJCAI
- 2007

Mitchell and Ternovska [49, 50] propose a constraint programming framework for search problems that is based on classical logic extended with inductive definitions. They formulate a search problem as the problem of model expansion (MX). In this framework, the problem is encoded in a logic, an instance of the problem is represented by a finite structure, and… (More)

- Ján Manuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk
- Graph Drawing
- 2010

- Ján Manuch, Murray Patterson, Roland Wittler, Cédric Chauve, Eric Tannier
- BMC Bioinformatics
- 2012

Recovering the structure of ancestral genomes can be formalized in terms of properties of binary matrices such as the Consecutive-Ones Property (C1P). The Linearization Problem asks to extract, from a given binary matrix, a maximum weight subset of rows that satisfies such a property. This problem is in general intractable, and in particular if the… (More)

Aggregate indices can assist decision-making by summarising a complex array of information. However, little research has been conducted on aggregate environmental indicators. The purpose of this paper is to address the debate surrounding aggregate environmental indices. In doing so, the paper highlights the strengths and weaknesses of aggregate indices for… (More)

- Nigel Jollands, Jonathan Lermit, Murray Patterson
- Journal of environmental management
- 2004

Eco-efficiency has emerged as a management response to waste issues associated with current production processes. Despite the popularity of the term in both business and government circles, limited attention has been paid to measuring and reporting eco-efficiency to government policy makers. Aggregate measures of eco-efficiency are needed, to complement… (More)

- Murray Patterson, Tobias Marschall, +4 authors Alexander Schönhuth
- RECOMB
- 2014

The human genome is diploid, that is each of its chromosomes comes in two copies. This requires to phase the single nucleotide polymorphisms (SNPs), that is, to assign them to the two copies, beyond just detecting them. The resulting haplotypes, lists of SNPs belonging to each copy, are crucial for downstream analyses in population genetics. Currently,… (More)

- Cédric Chauve, Murray Patterson, Ashok Rajaraman
- IWOCA
- 2013

The Consecutive-Ones Property (C1P) is a classical concept in discrete mathematics that has been used in several genomics applications , from physical mapping of contemporary genomes to the assembly of ancient genomes. A common issue in genome assembly concerns repeats , genomic sequences that appear in several locations of a genome. Handling repeats leads… (More)

- Cédric Chauve, Ján Manuch, Murray Patterson
- Electronic Notes in Discrete Mathematics
- 2009

Motivated by problems of comparative genomics and paleogenomics, we introduce the Gapped Consecutive-Ones Property Problem (k,δ)-C1P: given a binary matrix M and two integers k and δ, can the columns of M be permuted such that each row contains at most k sequences of 1's and no two consecutive sequences of 1's are separated by a gap of more than δ 0's. The… (More)

A binary matrix has the Consecutive-Ones Property (C1P) if its columns can be ordered in such a way that all 1's in each row are consecutive. We consider here a variant of the C1P where columns can appear multiple times in the ordering. Although the general problem of deciding the C1P with multiplicity is NP-complete, we present here a case of interest in… (More)