Pattern matching algorithms have gained a lot of importance in computer science, primarily
because they are used in various domains such as computational biology, video retrieval …

The string matching algorithms are among the essential fields in computer science, such as
text search, intrusion detection systems, fraud detection, sequence search in bioinformatics …

Cartesian tree pattern matching consists of finding all the factors of a text that have the same
Cartesian tree than a given pattern. There already exist theoretical and practical solutions for …

Park et al.[TCS 2020] observed that the similarity between two (numerical) strings can be
captured by the Cartesian trees: The Cartesian tree of a string is a binary tree recursively …

Dizi eşleştirme algoritmaları tıp, biyoinformatik, biyoloji gibi birçok alandaki çeşitli
uygulamaları nedeniyle bilgisayar bilimindeki önemli çalışma konularından olmuştur. Son …

Many papers in the intersection of theoretical and applied algorithms show that the simple,
asymptotically less efficient algorithm, performs better than the bestcomplex theoretical …

Palindromes are popular and important objects in textual data processing, bioinformatics,
and combinatorics on words. Let S= X a Y be a string where X and Y are of the same length …

The exact string matching algorithms are among the important study topics in computer
science due to their various applications in many fields such as medicine, bioinformatics …

Two strings of the same length are said to Cartesian-tree match (CT-match) if their Cartesian-
trees are isomorphic [Park et al., TCS 2020]. Cartesian-tree matching is a natural model that …

The Cartesian-tree pattern matching is a recently introduced scheme of pattern matching
that detects fragments in a sequential data stream which have a similar structure as a query …