Displaying similar documents to “Symbol-crunching with the transfer-matrix method in order to count skinny physical creatures.”

Implementation of directed acyclic word graph

Miroslav Balík (2002)

Kybernetika

Similarity:

An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DAWG for a text T is a minimal automaton that accepts all substrings of a text T , so it represents a complete index of the text. While all usual implementations of DAWG needed about 30 times larger storage space than was the size of the text, here we show an implementation that decreases this requirement down to four times the size of the text. The method uses a compression of DAWG elements, i....

A note on domino shuffling.

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

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A weighted HP model for protein folding with diagonal contacts

Hans-Joachim Böckenhauer, Dirk Bongartz (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

The HP model is one of the most popular discretized models for attacking the protein folding problem, , for the computational prediction of the tertiary structure of a protein from its amino acid sequence. It is based on the assumption that interactions between hydrophobic amino acids are the main force in the folding process. Therefore, it distinguishes between polar and hydrophobic amino acids only and tries to embed the amino acid sequence into a two- or three-dimensional grid...