Detecting Pattern Efficiently with Don't Cares

Hayam Alamro; Costas Iliopoulos

Detecting Pattern Efficiently with Don't Cares

Department of Information Systems, Princess Nourah bint Abdulrahman University, Riyadh, KSA

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

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.

Original language	English
Title of host publication	Proceedings of the 21st {EANN} (Engineering Applications of Neural Networks) 2020 Conference - Proceedings of the {EANN} 2020, Halkidiki, Greece, June 5-7, 2020
Publisher	Springer
Pages	447--459
Volume	2
Publication status	Published - 2020

Publication series

Name	Proceedings of the International Neural Networks Society
Publisher	Springer
Volume	2

Keywords

Pattern
Don’t cares
Detect

Access to Document

https://doi.org/10.1007/978-3-030-48791-1\_35

Cite this

Alamro, H., & Iliopoulos, C. (2020). Detecting Pattern Efficiently with Don't Cares. In Proceedings of the 21st {EANN} (Engineering Applications of Neural Networks) 2020 Conference - Proceedings of the {EANN} 2020, Halkidiki, Greece, June 5-7, 2020 (Vol. 2, pp. 447--459). (Proceedings of the International Neural Networks Society; Vol. 2). Springer. https://doi.org/10.1007/978-3-030-48791-1\_35

@inbook{cdad02099c7f465bb832f64a09db561c,

title = "Detecting Pattern Efficiently with Don't Cares",

abstract = "In this paper, we introduce our efficient simple method which can locate all occurrences of pattern P of k subpatterns with “don{\textquoteright}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{\textquoteright}t cares” in text S in a fast and effective manner.",

keywords = "Pattern, Don{\textquoteright}t cares, Detect",

author = "Hayam Alamro and Costas Iliopoulos",

year = "2020",

language = "English",

volume = "2",

series = "Proceedings of the International Neural Networks Society",

publisher = "Springer",

pages = "447----459",

booktitle = "Proceedings of the 21st {EANN} (Engineering Applications of Neural Networks) 2020 Conference - Proceedings of the {EANN} 2020, Halkidiki, Greece, June 5-7, 2020",

}

Alamro, H & Iliopoulos, C 2020, Detecting Pattern Efficiently with Don't Cares. in Proceedings of the 21st {EANN} (Engineering Applications of Neural Networks) 2020 Conference - Proceedings of the {EANN} 2020, Halkidiki, Greece, June 5-7, 2020. vol. 2, Proceedings of the International Neural Networks Society, vol. 2, Springer, pp. 447--459. <https://doi.org/10.1007/978-3-030-48791-1\_35>

Detecting Pattern Efficiently with Don't Cares. / Alamro, Hayam ; Iliopoulos, Costas.
Proceedings of the 21st {EANN} (Engineering Applications of Neural Networks) 2020 Conference - Proceedings of the {EANN} 2020, Halkidiki, Greece, June 5-7, 2020. Vol. 2 Springer, 2020. p. 447--459 (Proceedings of the International Neural Networks Society; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Detecting Pattern Efficiently with Don't Cares

AU - Alamro, Hayam

AU - Iliopoulos, Costas

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

KW - Pattern

KW - Don’t cares

KW - Detect

M3 - Chapter

VL - 2

T3 - Proceedings of the International Neural Networks Society

SP - 447

EP - 459

BT - Proceedings of the 21st {EANN} (Engineering Applications of Neural Networks) 2020 Conference - Proceedings of the {EANN} 2020, Halkidiki, Greece, June 5-7, 2020

PB - Springer

ER -

Detecting Pattern Efficiently with Don't Cares

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Cite this