Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Hirschbergs_algorithm> ?p ?o }
Showing triples 1 to 49 of
49
with 100 triples per page.
- Hirschbergs_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.".
- Hirschbergs_algorithm wikiPageID "10171509".
- Hirschbergs_algorithm wikiPageLength "8419".
- Hirschbergs_algorithm wikiPageOutDegree "25".
- Hirschbergs_algorithm wikiPageRevisionID "702156801".
- Hirschbergs_algorithm wikiPageWikiLink Algorithm.
- Hirschbergs_algorithm wikiPageWikiLink Arg_max.
- Hirschbergs_algorithm wikiPageWikiLink BLAST.
- Hirschbergs_algorithm wikiPageWikiLink Big_O_notation.
- Hirschbergs_algorithm wikiPageWikiLink Category:Articles_with_example_pseudocode.
- Hirschbergs_algorithm wikiPageWikiLink Category:Bioinformatics_algorithms.
- Hirschbergs_algorithm wikiPageWikiLink Category:Dynamic_programming.
- Hirschbergs_algorithm wikiPageWikiLink Category:Sequence_alignment_algorithms.
- Hirschbergs_algorithm wikiPageWikiLink Computational_biology.
- Hirschbergs_algorithm wikiPageWikiLink Computer_science.
- Hirschbergs_algorithm wikiPageWikiLink DNA.
- Hirschbergs_algorithm wikiPageWikiLink Dan_Hirschberg.
- Hirschbergs_algorithm wikiPageWikiLink Diff_utility.
- Hirschbergs_algorithm wikiPageWikiLink Divide_and_conquer_algorithms.
- Hirschbergs_algorithm wikiPageWikiLink Dynamic_programming.
- Hirschbergs_algorithm wikiPageWikiLink FASTA.
- Hirschbergs_algorithm wikiPageWikiLink Heuristic_(computer_science).
- Hirschbergs_algorithm wikiPageWikiLink Levenshtein_distance.
- Hirschbergs_algorithm wikiPageWikiLink Longest_common_subsequence_problem.
- Hirschbergs_algorithm wikiPageWikiLink Needleman–Wunsch_algorithm.
- Hirschbergs_algorithm wikiPageWikiLink Protein.
- Hirschbergs_algorithm wikiPageWikiLink Sequence_alignment.
- Hirschbergs_algorithm wikiPageWikiLink String_(computer_science).
- Hirschbergs_algorithm wikiPageWikiLinkText "Hirschberg's algorithm".
- Hirschbergs_algorithm wikiPageUsesTemplate Template:Reflist.
- Hirschbergs_algorithm wikiPageUsesTemplate Template:Strings.
- Hirschbergs_algorithm subject Category:Articles_with_example_pseudocode.
- Hirschbergs_algorithm subject Category:Bioinformatics_algorithms.
- Hirschbergs_algorithm subject Category:Dynamic_programming.
- Hirschbergs_algorithm subject Category:Sequence_alignment_algorithms.
- Hirschbergs_algorithm hypernym Algorithm.
- Hirschbergs_algorithm type Software.
- Hirschbergs_algorithm type Algorithm.
- Hirschbergs_algorithm type Method.
- Hirschbergs_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.".
- Hirschbergs_algorithm label "Hirschberg's algorithm".
- Hirschbergs_algorithm sameAs Q1620364.
- Hirschbergs_algorithm sameAs Hirschberg-Algorithmus.
- Hirschbergs_algorithm sameAs m.02q435z.
- Hirschbergs_algorithm sameAs Hirsbergov_algoritam.
- Hirschbergs_algorithm sameAs ขั้นตอนวิธีของเฮิร์ชเบิร์ก.
- Hirschbergs_algorithm sameAs Q1620364.
- Hirschbergs_algorithm wasDerivedFrom Hirschbergs_algorithm?oldid=702156801.
- Hirschbergs_algorithm isPrimaryTopicOf Hirschbergs_algorithm.