Morteza Mohammad Noori

activity

20072021

collaborators

6 papers

math.CO2021

Closed Ziv-Lempel factorization of the $m$ -bonacci words

Marieh Jahannia, Morteza Mohammad-noori, Narad Rampersad +1

A word $w$ is said to be closed if it has a proper factor $x$ which occurs exactly twice in $w$ , as a prefix and as a suffix of $w$ . Based on the concept of Ziv-Lempel factorizatio…

cs.DM2021

Generalized Gapped-kmer Filters for Robust Frequency Estimation

Morteza Mohammad-Noori, Narges Ghareghani, Mahmood Ghandi

In this paper, we study the generalized gapped k-mer filters and derive a closed form solution for their coefficients. We consider nonnegative integers $ℓ$ and $k$ , with $k\leq…

math.CO2019

Some properties of $k$ -bonacci words on infinite alphabet

Narges Ghareghani, Pouyeh Sharifani, Morteza Mohammad-Noori

The Fibonacci word $W$ on an infinite alphabet was introduced in [Zhang et al., Electronic J. Combinatorics 2017 24(2), 2-52] as a fixed point of the morphism $2i\rightarrow (2i)(2…

cs.DM2019

Palindromic Ziv-Lempel and Crochemore Factorizations of $m$ -Bonacci Infinite Words

Marieh Jahannia, Morteza Mohammad-noori, Narad Rampersad +1

We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci wor…

cs.DM2010

On z-factorization and c-factorization of standard episturmian words

M. Mohammad-Nooria, N. Ghareghanib, P. Sharifani

Ziv-Lempel and Crochemore factorization are two kinds of factorizations of words related to text processing. In this paper, we find these factorizations for standard epiesturmian w…

math.CO2007

Inclusion Matrices and Chains

E. Ghorbani, G. B. Khosrovshahi, Ch. Maysoori +1

Given integers $t$ , $k$ , and $v$ such that $0 \leq t \leq k \leq v$ , let $W_{t k} (v)$ be the inclusion matrix of $t$ -subsets vs. $k$ -subsets of a $v$ -set. We modify slightly the concep…