#### Filter Results:

#### Publication Year

1988

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

#### Brain Region

#### Cell Type

#### Method

#### Organism

Learn More

We present a dynamic programming algorithm for computing a best global alignment of two sequences. The proposed algorithm is robust in identifying any of several global relationships between two sequences. The algorithm delivers a best alignment of two sequences in linear space and quadratic time. We also describe a multiple alignment algorithm based on the… (More)

We describe two methods for constructing an optimal global alignment of, and an optimal local alignment between, a DNA sequence and a protein sequence. The alignment model of the methods addresses the problems of frameshifts and introns in the DNA sequence. The methods require computer memory proportional to the sequence lengths, so they can rigorously… (More)

For most sequence comparison problems there is a corresponding map comparison algorithm. While map data may appear to be incompatible with dynamic programming, we show in this paper that the rigor and efficiency of dynamic programming algorithms carry over to the map comparison algorithms. We present algorithms for restriction map comparison that deal with… (More)

- Yi Xie, J. Hu, S. Tang, X. Huang
- Comput. J.
- 2013

- Thomas J. Vogels, Thomas Zanon, Rao Desineni, R. D. Blanton, Wojciech Maly, Jason G. Brown +7 others
- ITC
- 2004

Diagnosis algorithms for integrated circuits (ICs) are typically developed and evaluated using a limited number of logic-level models of defect behaviors. However, it is well-known that renl IC defects exhibit behavior well outside these models. Consequently, the utility of IC diagnosis methodologies may be uncertain. In this paper, a simulation-based… (More)