Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hirschberg's_algorithm> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Hirschberg's_algorithm abstract "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 divide and conquer version of the Needleman–Wunsch algorithm. Hirschberg's algorithm is commonly used in computational biology to find maximal global alignments of DNA and protein sequences.".
- Hirschberg's_algorithm wikiPageID "10171509".
- Hirschberg's_algorithm wikiPageRevisionID "585565989".
- Hirschberg's_algorithm hasPhotoCollection Hirschberg's_algorithm.
- Hirschberg's_algorithm subject Category:Articles_with_example_pseudocode.
- Hirschberg's_algorithm subject Category:Bioinformatics_algorithms.
- Hirschberg's_algorithm subject Category:Dynamic_programming.
- Hirschberg's_algorithm subject Category:Sequence_alignment_algorithms.
- Hirschberg's_algorithm type Abstraction100002137.
- Hirschberg's_algorithm type Act100030358.
- Hirschberg's_algorithm type Activity100407535.
- Hirschberg's_algorithm type Algorithm105847438.
- Hirschberg's_algorithm type AlgorithmsOnStrings.
- Hirschberg's_algorithm type BioinformaticsAlgorithms.
- Hirschberg's_algorithm type Event100029378.
- Hirschberg's_algorithm type Procedure101023820.
- Hirschberg's_algorithm type PsychologicalFeature100023100.
- Hirschberg's_algorithm type Rule105846932.
- Hirschberg's_algorithm type SequenceAlignmentAlgorithms.
- Hirschberg's_algorithm type YagoPermanentlyLocatedEntity.
- Hirschberg's_algorithm comment "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 divide and conquer version of the Needleman–Wunsch algorithm.".
- Hirschberg's_algorithm label "Hirschberg's algorithm".
- Hirschberg's_algorithm label "Hirschberg-Algorithmus".
- Hirschberg's_algorithm sameAs Hirschberg-Algorithmus.
- Hirschberg's_algorithm sameAs m.02q435z.
- Hirschberg's_algorithm sameAs Q1620364.
- Hirschberg's_algorithm sameAs Q1620364.
- Hirschberg's_algorithm sameAs Hirschberg's_algorithm.
- Hirschberg's_algorithm wasDerivedFrom Hirschberg's_algorithm?oldid=585565989.
- Hirschberg's_algorithm isPrimaryTopicOf Hirschberg's_algorithm.