Everything about Hirschberg's algorithm
Algorithm for aligning two sequences
In computer science, Hirschberg's algorithm, named after its inventor, Dan Hirschberg, is a dynamic programming algorithm that finds the optimal sequence alignment between two strings. Optimality is measured with the Levenshtein distance, defined to be the sum of the costs of insertions, replacements, deletions, and null actions needed to change one string into the other. Hirschberg's algorithm is simply described as a more space-efficient version of the Needleman–Wunsch algorithm that uses dynamic programming. Hirschberg's algorithm is commonly used in computational biology to find maximal global alignments of DNA and protein sequences. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Hirschberg's algorithmA 5-minute orientation
- Pick up a classic book: Guidance and control 2007The most-reprinted book on the subject
- Go sideways: Smith–Waterman algorithmA closely related topic
- Go sideways: Needleman–Wunsch algorithmA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
đź“š Books worth reading
- 📕Guidance and control 2007Colo.) Rocky Mountain Guidance and Control Conference (30th 2007 Breckenridge · 2007
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Smith–Waterman algorithm The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings of nucleic acid sequences…
- Needleman–Wunsch algorithm The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align protein or nucleotide sequences. It was one of the first applications of…
- Levenshtein distance In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences…
- ProbCons In bioinformatics and proteomics, ProbCons is an open source software for probabilistic consistency-based multiple alignment of amino acid sequences. It…
- Cardinal function In mathematics, a cardinal function (or cardinal invariant) is a function that returns cardinal numbers. The most frequently used cardinal function is…
- Dynamic time warping In time series analysis, dynamic time warping (DTW) is an algorithm for measuring similarity between two temporal sequences, which may vary in speed. For…
- M8 (cipher) In cryptography, M8 is a block cipher designed by Hitachi in 1999. It is a modification of Hitachi's earlier M6 algorithm, designed for greater security…
- Kendall rank correlation coefficient In statistics, the Kendall rank correlation coefficient, commonly referred to as Kendall's τ coefficient (after the Greek letter τ, tau), is a statistic…