Data Portal @ linkeddatafragments.org

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/String-to-string_correction_problem> ?p ?o. }

• String-to-string_correction_problem abstract "In computer science, the string-to-string correction problem refers to the minimum number of edit operations necessary to change one string into another. A single edit operation may be changing a single symbol of the string into another, deleting, or inserting a symbol. The length of the edit sequence provides a measure of the distance between the two strings.Several algorithms exist to provide an efficient way to determine string distance and specify the minimum number of transformation operations required. Such algorithms are particularly useful for delta creation operations where something is stored as a set of differences relative to a base version. This allows several versions of a single object to be stored much more efficiently than storing them separately. This holds true even for single versions of several objects if they do not differ greatly, or anything in between. Notably, such difference algorithms are used in molecular biology to provide some measure of kinship between different kinds of organisms based on the similarities of their macromolecules (such as proteins or DNA).".
• String-to-string_correction_problem wikiPageID "1899780".
• String-to-string_correction_problem wikiPageRevisionID "551511739".
• String-to-string_correction_problem hasPhotoCollection String-to-string_correction_problem.
• String-to-string_correction_problem subject Category:Problems_on_strings.
• String-to-string_correction_problem subject Category:String_similarity_measures.
• String-to-string_correction_problem type Abstraction100002137.
• String-to-string_correction_problem type Act100030358.
• String-to-string_correction_problem type Action100037396.
• String-to-string_correction_problem type Activity100407535.
• String-to-string_correction_problem type Algorithm105847438.
• String-to-string_correction_problem type AlgorithmsOnStrings.
• String-to-string_correction_problem type Attribute100024264.
• String-to-string_correction_problem type Choice100161243.
• String-to-string_correction_problem type Condition113920835.
• String-to-string_correction_problem type Decision100162632.
• String-to-string_correction_problem type Difficulty114408086.
• String-to-string_correction_problem type Event100029378.
• String-to-string_correction_problem type Maneuver100168237.
• String-to-string_correction_problem type Measure100174412.
• String-to-string_correction_problem type Move100165942.
• String-to-string_correction_problem type Problem114410605.
• String-to-string_correction_problem type ProblemsOnStrings.
• String-to-string_correction_problem type Procedure101023820.
• String-to-string_correction_problem type PsychologicalFeature100023100.
• String-to-string_correction_problem type Rule105846932.
• String-to-string_correction_problem type State100024720.
• String-to-string_correction_problem type StringSimilarityMeasures.
• String-to-string_correction_problem type YagoPermanentlyLocatedEntity.
• String-to-string_correction_problem comment "In computer science, the string-to-string correction problem refers to the minimum number of edit operations necessary to change one string into another. A single edit operation may be changing a single symbol of the string into another, deleting, or inserting a symbol.".
• String-to-string_correction_problem label "String-to-string correction problem".
• String-to-string_correction_problem sameAs m.064snk.
• String-to-string_correction_problem sameAs Q7623900.
• String-to-string_correction_problem sameAs Q7623900.
• String-to-string_correction_problem sameAs String-to-string_correction_problem.
• String-to-string_correction_problem wasDerivedFrom String-to-string_correction_problem?oldid=551511739.
• String-to-string_correction_problem isPrimaryTopicOf String-to-string_correction_problem.