Javascript must be enabled to continue!
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
View through CrossRef
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 a Lyndon word. We propose algorithms for finding such a subsequence in O(n 3) time with O(n) space, or online in O(n 3) space and time. Our first result can be extended to find the longest common Lyndon subsequence of two strings of length n in O(n 4 σ) time using O(n 2) space.
Research Square Platform LLC
Title: Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Description:
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 a Lyndon word.
We propose algorithms for finding such a subsequence in O(n 3) time with O(n) space, or online in O(n 3) space and time.
Our first result can be extended to find the longest common Lyndon subsequence of two strings of length n in O(n 4 σ) time using O(n 2) space.
Related Results
Longest Order Conserved Exemplar Subsequences
Longest Order Conserved Exemplar Subsequences
Abstract
We propose a new problem whose input data are two linear genomes together with two indexed gene subsequences of them, which asks to find a longest common e...
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...
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Objective: To determine the frequency of common chromosomal aberrations in local population idiopathic determine the frequency of common chromosomal aberrations in local population...
Kinetics of folding of αα‐tropomyosin subsequences
Kinetics of folding of αα‐tropomyosin subsequences
AbstractThe kinetics of folding random coils of αα‐tropomyosin (Tm) subsequences to two‐chain coiled coils was studied by stopped‐flow CD. Subsequences studied were those comprisin...
Practical Evaluation of Lyndon Factors via Alphabet Reordering
Practical Evaluation of Lyndon Factors via Alphabet Reordering
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...
CLOUD COMPUTING - NAVIGATING THE DIGITAL SKY
CLOUD COMPUTING - NAVIGATING THE DIGITAL SKY
“Cloud Computing – Navigating the Digital Sky” is an extensive guide designed to provide a thorough understanding of cloud computing, an essential technology in today’s digital age...
Adoption Strategy for Cloud Computing in Kenyan Research Institutions
Adoption Strategy for Cloud Computing in Kenyan Research Institutions
Cloud computing has transformed the aspect of distributed computing from many other prevailing methods by offering more unlimited benefits, like cutting down computing costs and al...
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...

