Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Practical Evaluation of Lyndon Factors via Alphabet Reordering
View through CrossRef
We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string. Experiments with Pizza&Chili datasets show that for most alphabet reorderings, the number of Lyndon factors is usually small, and the length of the longest Lyndon factor can be as large as the input string, which is unfavorable for algorithms and indexes that depend on the number of Lyndon factors. We present results with randomized alphabet permutations that can be used as a baseline to assess the effectiveness of heuristics and methods designed to modify the Lyndon factorization of a string via alphabet reordering.
Title: Practical Evaluation of Lyndon Factors via Alphabet Reordering
Description:
We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string.
Experiments with Pizza&Chili datasets show that for most alphabet reorderings, the number of Lyndon factors is usually small, and the length of the longest Lyndon factor can be as large as the input string, which is unfavorable for algorithms and indexes that depend on the number of Lyndon factors.
We present results with randomized alphabet permutations that can be used as a baseline to assess the effectiveness of heuristics and methods designed to modify the Lyndon factorization of a string via alphabet reordering.
Related Results
Guiro: User-Guided Matrix Reordering Preprint Behrisch2019
Guiro: User-Guided Matrix Reordering Preprint Behrisch2019
Matrix representations are one of the main established and empirically proven to be effective visualization techniques for relational (or network) data. However, matrices —similar ...
Correct Pronunciation Detection of the Arabic Alphabet Using Deep Learning
Correct Pronunciation Detection of the Arabic Alphabet Using Deep Learning
Automatic speech recognition for Arabic has its unique challenges and there has been relatively slow progress in this domain. Specifically, Classic Arabic has received even less re...
Non-Recommended Publishing Lists: Strategies for Detecting Deceitful Journals
Non-Recommended Publishing Lists: Strategies for Detecting Deceitful Journals
Abstract
The rapid growth of open access publishing (OAP) has significantly improved the accessibility and dissemination of scientific knowledge. However, this expansion has also c...
Recovery of loss of packet in network using constant packet reordering
Recovery of loss of packet in network using constant packet reordering
When the packet is reordered the most standard implementation of the Transmission control protocol (TCP) gives poor performance. This paper proposes a new version of the TCP which ...
THE ATTITUDE OF THE THREE ALBANIAN RINSIERS FOR THE ALBANIAN LANGUAGE ALPHABET – GJERGJ QIRIAZI, FAIK KONICA, MIT’HAT FRASHËRI
THE ATTITUDE OF THE THREE ALBANIAN RINSIERS FOR THE ALBANIAN LANGUAGE ALPHABET – GJERGJ QIRIAZI, FAIK KONICA, MIT’HAT FRASHËRI
This paper aims to give an overview of the stances of three Albanian Renessaince representatives on the Albanian language alphabet and script. This comparison of three important fi...
Enhancing Graph-based Machine Learning through Lyndon Partial Words
Enhancing Graph-based Machine Learning through Lyndon Partial Words
Objectives: This study integrates the combinatorial properties of Lyndon partial words with Graph-Based Machine Learning (GBML) to develop an innovative approach for sequence analy...
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
AbstractGiven a string T of length n whose characters are drawn from an ordered alphabet of size $$\sigma $$
σ
, its longest Lyndon subsequence is...
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Abstract
Given a string T with length n whose characters are drawn from an ordered alphabet of size σ, its longest Lyndon subsequence is a longest subsequence of T that is ...