### Abstract

In this paper we consider the external inverse pattern matching problem. Given a text T of lengthn over an ordered alphabet Σ and a number m ≤ n, the goal is to find a pattern (formula presented)MAX ∈ Σ^{m} which is not a subword of T and which maximizes the sum of Hamming distances between (formula presented)MAX and all subwords of T of length m. We present an optimal O(n log σ)-time (where σ = ∣Σ∣) algorithm for the external inverse pattern matching problem. This substantially improves the O(nm log σ)-time algorithm given in [2]. Moreover we discuss briefly fast parallel implementation of our algorithm on the CREW PRAM model.

Original language | English (US) |
---|---|

Title of host publication | Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings |

Editors | Alberto Apostolico, Jotun Hein, Alberto Apostolico |

Publisher | Springer Verlag |

Pages | 90-101 |

Number of pages | 12 |

ISBN (Print) | 9783540632207 |

State | Published - Jan 1 1997 |

Externally published | Yes |

Event | 8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 - Aarhus, Denmark Duration: Jun 30 1997 → Jul 2 1997 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1264 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 |
---|---|

Country | Denmark |

City | Aarhus |

Period | 6/30/97 → 7/2/97 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings*(pp. 90-101). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1264). Springer Verlag.