King's College London

Research portal

Detecting Pattern Efficiently with Don't Cares

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Original languageEnglish
Title of host publicationProceedings of the 21st {EANN} (Engineering Applications of Neural Networks) 2020 Conference - Proceedings of the {EANN} 2020, Halkidiki, Greece, June 5-7, 2020
PublisherSpringer
Pages447--459
Volume2
Published2020

Publication series

NameProceedings of the International Neural Networks Society
PublisherSpringer
Volume2

King's Authors

Abstract

In this paper, we introduce our efficient simple method which can locate all occurrences of pattern P of k subpatterns with “don’t cares” of length m in text S of length n. Our algorithm employs advanced data structure and the Kangaroo method, which can be applied to selected suffixes of the suffix tree of S to answer subsequent queries in O(k) time using a predefined computational method to find all occurrences of pattern P with “don’t cares” in text S in a fast and effective manner.

View graph of relations

© 2020 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454