Add to ORKGWe discuss a model for the evolutionary distance between two coding DNA sequences which specializes to the DNA/protein model proposed in Hein [3]. We discuss the DNA/protein model in details and present a quadratic time algorithm that computes an optimal alignment of two coding DNA sequences in the model under the assumption of affine gap cost. The algorithm solves a conjecture in [3] and we believe that the constant factor of the running time is sufficiently small to make the algorithm feasible in practice
The contemporary computational biology gives motivation to study dependencies between finite sequenc...
This repository contains 24,000 pairs of nucleotide sequences (and associated parameters) that have ...
Abslract- DNA matching is an important key to understanding genomes, evolution, relationships betwee...
We describe two methods for constructing an optimal global alignment of, and an optimal local alignm...
DNA codes consisting of DNA sequences are necessary for DNA computing. The minimum distance paramete...
The main focus of this article is to describe our original approach to compare the quality of define...
Finding the sequence similarity between two genetic codes is an important problem in computational b...
Alignment-free methods are increasingly used to calculate evolutionary distances between DNA and pro...
We consider DNA codes based on the nearest neighbor (stem) similarity model which adequately reflect...
Graduation date: 1993As the volume of genetic sequence data increases due to improved sequencing\ud ...
The increasing number of sequenced genomes motivates the use of evolutionary patterns to detect gene...
International audienceAlignment-free methods are increasingly used to estimate distances between DNA...
We study the problem of computing optimal spaced seeds for identifying homologous coding DNA sequen...
Abstract. For DNA computing, it is desired to generate codes of large size and large distance. A com...
Models of DNA sequence evolution and methods for estimating evolutionary distances are needed for st...
The contemporary computational biology gives motivation to study dependencies between finite sequenc...
This repository contains 24,000 pairs of nucleotide sequences (and associated parameters) that have ...
Abslract- DNA matching is an important key to understanding genomes, evolution, relationships betwee...
We describe two methods for constructing an optimal global alignment of, and an optimal local alignm...
DNA codes consisting of DNA sequences are necessary for DNA computing. The minimum distance paramete...
The main focus of this article is to describe our original approach to compare the quality of define...
Finding the sequence similarity between two genetic codes is an important problem in computational b...
Alignment-free methods are increasingly used to calculate evolutionary distances between DNA and pro...
We consider DNA codes based on the nearest neighbor (stem) similarity model which adequately reflect...
Graduation date: 1993As the volume of genetic sequence data increases due to improved sequencing\ud ...
The increasing number of sequenced genomes motivates the use of evolutionary patterns to detect gene...
International audienceAlignment-free methods are increasingly used to estimate distances between DNA...
We study the problem of computing optimal spaced seeds for identifying homologous coding DNA sequen...
Abstract. For DNA computing, it is desired to generate codes of large size and large distance. A com...
Models of DNA sequence evolution and methods for estimating evolutionary distances are needed for st...
The contemporary computational biology gives motivation to study dependencies between finite sequenc...
This repository contains 24,000 pairs of nucleotide sequences (and associated parameters) that have ...
Abslract- DNA matching is an important key to understanding genomes, evolution, relationships betwee...