#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1950

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### 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)

- 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)

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

Monotone Drawings of Graphs p. 13 Upward Geometric Graph Embeddings into Point Sets p. 25 On a Tree and a Path with No Geometric Simultaneous Embedding p. 38 Difference Map Readability for Dynamic Graphs p. 50 Maximizing the Total Resolution of Graphs p. 62 Plane Drawings of Queue and Deque Graphs p. 68 An Experimental Evaluation of Multilevel Layout… (More)

- Ján Manuch, Murray Patterson, Arvind Gupta
- ISBRA
- 2011

- 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)

- 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)

- 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)

- Ján Manuch, Murray Patterson, Arvind Gupta
- COCOON
- 2009

- Bob Costanza, Bruce Hannon, +9 authors Matthew Wilson
- 1999

(1) Publish a theoretical manuscript (or group of manuscripts) that articulates our interdisciplinary approach to global ecosystem service valuation (2) Create a database that brings relevant social, economic, and ecological data together in a fully relational format (3) Develop an integrated, dynamic model of ecological and economic systems to more… (More)

- Murray Patterson, Tobias Marschall, +4 authors Alexander Schönhuth
- Journal of Computational Biology
- 2015

The human genome is diploid, which requires assigning heterozygous single nucleotide polymorphisms (SNPs) to the two copies of the genome. The resulting haplotypes, lists of SNPs belonging to each copy, are crucial for downstream analyses in population genetics. Currently, statistical approaches, which are oblivious to direct read information, constitute… (More)