Displaying similar documents to “A weighted HP model for protein folding with diagonal contacts”

A note on domino shuffling.

Janvresse, É., de la Rue, T., Velenik, Y. (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Labeled shortest paths in digraphs with negative and positive edge weights

Phillip G. Bradford, David A. Thomas (2009)

RAIRO - Theoretical Informatics and Applications

Similarity:

This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in the underlying unlabeled graph. These results build directly on an algorithm of Barrett  [ (2000) 809–837]. In addition to many other results, they gave a shortest path algorithm for CFG labeled and weighted digraphs where all edges are nonnegative. Our algorithm is based...

The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification

Hans-Joachim Böckenhauer, Michal Forišek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Analyzing genomic data for finding those gene variations which are responsible for hereditary diseases is one of the great challenges in modern bioinformatics. In many living beings (including the human), every gene is present in two copies, inherited from the two parents, the so-called . In this paper, we propose a simple combinatorial model for classifying the set of haplotypes in a population according to their responsibility for a certain genetic disease. This model is based...