Hirschberg's algorithm

Known as: Hirschberg algorithm 
In computer science, Hirschberg's algorithm, named after its inventor, Dan Hirschberg, is a dynamic programming algorithm that finds the optimal… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2000-2016
012320002016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Fast and efficient protein sequence alignment and comparison algorithms have become significance as the size of databases grow… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
2009
2009
Dynamic programming-based algorithm such as Smith-Waterman algorithm, which produces the most optimal result, has been known as… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
A combinatorial approach for protecting Web applications against SQL injection is discussed in this paper, which is a novel idea… (More)
  • table 2
Is this relevant?
2008
2008
Based on a new way to compute check points, this paper presents a "Block Recursive" sequence alignment algorithm, which can run… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
2007
2007
In this paper, we apply two different parallel programming model, the message passing model using Message Passing Interface (MPI… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the… (More)
Is this relevant?
Review
2005
Review
2005
Multiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP -hard to find an optimal… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 11
Is this relevant?
2003
2003
Sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length m… (More)
  • table 1
  • figure 1
  • figure 3
  • table 2
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The standard method of applying hidden Markov models to biological problems is to find a Viterbi (maximal weight) path through… (More)
  • figure 1
Is this relevant?
2000
2000
For two strings of length m and n (m n), optimal sequence alignment (as a function of the alignment scoring function) takes time… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?