Pages that link to "Item:Q1391305"

The following pages link to Block edit models for approximate string matching (Q1391305):

Displaying 15 items.

• An efficient algorithm for sequence comparison with block reversals (Q596144) (← links)
• An algorithm with linear expected running time for string editing with substitutions and substring reversals (Q963370) (← links)
• Efficient algorithms for the block edit problems (Q963999) (← links)
• Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time (Q1029706) (← links)
• An integer linear programming approach for approximate string comparison (Q1042045) (← links)
• The greedy algorithm for edit distance with moves (Q1045883) (← links)
• Edit distance with block deletions (Q1736478) (← links)
• Quick greedy computation for minimum common string partition (Q2015138) (← links)
• Distance measures for biological sequences: some recent approaches (Q2270379) (← links)
• Edit distance with move operations (Q2457310) (← links)
• An extension of the Burrows-Wheeler transform (Q2465062) (← links)
• Fast computation of a string duplication history under no-breakpoint-reuse (Q2955628) (← links)
• Quick Greedy Computation for Minimum Common String Partitions (Q3011861) (← links)
• An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
• (Q5009593) (← links)