Lanean...

Staircase patterns in words: subsequences, subwords, and separation number

We revisit staircases for words and prove several exact as well as asymptotic results for longest left-most staircase subsequences and subwords and staircase separation number. The latter is defined as the number of consecutive maximal staircase subwords packed in a word. We study asymptotic propert...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Argitaratua izan da:Eur J Comb
Egile Nagusiak: Mansour, Toufik, Rastegar, Reza, Roitershtein, Alexander
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: 2020
Gaiak:
Sarrera elektronikoa:https://ncbi.nlm.nih.gov/pmc/articles/PMC7185263/
https://ncbi.nlm.nih.gov/pubmed/32341615
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!