: 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 eectively exploit the physical constraints of the problem to derive more efficient 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...
CITATION STYLE
Eppstein, D., Galil, Z., Giancarlo, R., & Italiano, G. F. (1993). Efficient Algorithms for Sequence Analysis. In Sequences II (pp. 225–244). Springer New York. https://doi.org/10.1007/978-1-4613-9323-8_17
Mendeley helps you to discover research relevant for your work.