2 papers
cs.DS2024
Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees
Anas Al-okaily
Suffix trees are key and efficient data structure for solving string problems. A suffix tree is a compressed trie containing all the suffixes of a given text of length with a l…
cs.DS2021
Linear Approximate Pattern Matching Algorithm
Anas Al-okaily, Abdelghani Tbakhi
Pattern matching is a fundamental process in almost every scientific domain. The problem involves finding the positions of a given pattern (usually of short length) in a reference…