Although a number of normalized edit distances presented so far may offer good
performance in some applications, none of them can be regarded as a genuine metric …

We present an EST sequence assembler that specializes in reconstruction of pristine mRNA
transcripts, while at the same time detecting and classifying single nucleotide …

Two important similarity measures between sequences are the longest common
subsequence (LCS) and the dynamic time warping distance (DTWD). The computations of …

A multitude of algorithms for sequence comparison, short-read assembly and whole-
genome alignment have been developed in the general context of molecular biology, to …

Publisher Summary This chapter develops an algorithm for eliminating duplicates in
dimensional tables in a data warehouse, which are usually associated with hierarchies. It …

Abstract The Local Alignment problem is a classical problem with applications in biology.
Given two input strings and a scoring function on pairs of letters, one is asked to find the …

The enormous complexity of biological systems at the molecular level must be answered
with powerful computational methods. Computational biology is a young field, but has seen …

Similarity and dissimilarity measures are widely used in many research areas and
applications. When a dissimilarity measure is used, it is normally required to be a distance …

We describe two novel sequence similarity search algorithms, FASTS and FASTF, that use
multiple short peptide sequences to identify homologous sequences in protein or DNA …

Multiple sequence alignment is a fundamental tool in a number of different domains in
modern molecular biology, including functional and evolutionary studies of a protein family …