The complexity of finding minimum-length generator sequences
Theoretical Computer Science
Sorting permutations by block-interchanges
Information Processing Letters
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
SIAM Journal on Discrete Mathematics
Sorting by bounded block-moves
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
Information Processing Letters
Sorting Strings by Reversals and by Transpositions
SIAM Journal on Discrete Mathematics
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Information and Computation
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Sorting and Selection with Structured Costs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Improved bounds on sorting with length-weighted reversals
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Interchange Rearrangement: The Element-Cost Model
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
Interchange rearrangement: The element-cost model
Theoretical Computer Science
Efficient computations of l1 and l∞ rearrangement distances
Theoretical Computer Science
Approximate string matching with address bit errors
Theoretical Computer Science
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the cost of interchange rearrangement in strings
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Efficient computations of l1and l∞rearrangement distances
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Sorting and selection with random costs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the Cost of Interchange Rearrangement in Strings
SIAM Journal on Computing
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Approximate string matching with stuck address bits
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Approximate string matching with stuck address bits
Theoretical Computer Science
| Hi-index | 0.00 |
A basic assumption in traditional pattern matching is that the order of the elements in the given input strings is correct, while the description of the content, i.e. the description of the elements, may be erroneous. Motivated by questions that arise in Text Editing, Computational Biology, Bit Torrent and Video on Demand, and Computer Architecture, a new pattern matching paradigm was recently proposed by [2]. In this model, the pattern content remains intact, but the relative positions may change. Several papers followed the initial definition of the new paradigm. Each paper revealed new aspects in the world of string rearrangement metrics. This new unified view has already proven itself by enabling the solution of an open problem of the mathematician Cayley from 1849. It also gave better insight to problems that were already studied in different and limited situations, such as the behavior of different cost functions, and enabled deriving results for cost functions that were not yet sufficiently analyzed by previous research. At this stage, a general understanding of this new model is beginning to coalesce. The aim of this survey is to present an overview of this recent new direction of research, the problems, the methodologies, and the state-of-the-art.