Efficient Algorithms with Applications to Molecular Biology

David Eppstein, Zvi Galil and Raffaele Giancarlo
Additional contact information
David Eppstein: Columbia University, Computer Science Department
Zvi Galil: Columbia University, Computer Science Department
Raffaele Giancarlo: Columbia University, Computer Science Department

A chapter in Sequences, 1990, pp 59-74 from Springer

Abstract: Summary A number of important computational problems in molecular biology, geology, speech recognition, and other areas, can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, we speed up the computation of several of these recurrences by one or two orders of magnitude. Our algorithms are simple and practical.

Keywords: Binary Search; Edit Distance; Convex Case; Winning Candidate; Original Owner (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().