Efficient Algorithms for Sequence Analysis

Efficient Algorithms for Sequence Analysis (1991)

Cached

Download Links

[www.ics.uci.edu]

by David Eppstein , Zvi Galil , Raffaele Giancarlo , Giuseppe F. Italiano

Venue:	Proc. Second Workshop on Sequences: Combinatorics, Compression. Securiry
Citations:	1 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Efficient Algorithms for Sequence Analysis	user correction - Legacy Corrections
AUTHOR NAME	David Eppstein	user correction - Legacy Corrections
AUTHOR NAME	Zvi Galil	user correction - Legacy Corrections
AUTHOR AFFIL	1 Department of Information and Computer Science, University of California, Irvine	user correction - Legacy Corrections
AUTHOR ADDR	CA 92717	user correction - Legacy Corrections
AUTHOR NAME	Raffaele Giancarlo	user correction - Legacy Corrections
AUTHOR AFFIL	6 Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Rome	user correction - Legacy Corrections
AUTHOR ADDR	Italy	user correction - Legacy Corrections
AUTHOR NAME	Giuseppe F. Italiano	user correction - Legacy Corrections
ABSTRACT	: We consider new algorithms for the solution of many dynamic programming recurrences for sequence comparison and for RNA secondary structure prediction. The techniques upon which the algorithms are based e#ectively exploit the physical constraints of the problem to derive more e#cient methods for sequence analysis. 1. INTRODUCTION In this paper we consider algorithms for two problems in sequence analysis. The first problem is sequence alignment, and the second is the prediction of RNA structure. Although the two problems seem quite di#erent from each other, their solutions share a common structure, which can be expressed as a system of dynamic programming recurrence equations. These equations also can be applied to other problems, including text formatting and data storage optimization. We use a number of well motivated assumptions about the problems in order to provide e#cient algorithms. The primary assumption is that of concavity or convexity. The recurrence relations for bo...	user correction - Legacy Corrections
YEAR	1991	INFERENCE
VENUE	Proc. Second Workshop on Sequences: Combinatorics, Compression. Securiry	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	17--21	INFERENCE
CITATIONS	71 found	ParsCit 1.0