OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Hirschberg's algorithm

 Home Mathematics Fields of mathematics Applied mathematics Algorithms Bioinformatics algorithms
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Hirschberg's algorithm is a dynamic programming approach used for finding the longest common subsequence (LCS) of two sequences. It is particularly notable for its efficiency in terms of space complexity, using only linear space instead of the quadratic space that naive dynamic programming approaches require. ### Overview of the Algorithm: Hirschberg's algorithm is based on the principle of dividing and conquering.

 Ancestors (6)

  1. Bioinformatics algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook