Repetition-free longest common subsequence of random sequences (Q299053): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1305.4883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetition-free longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Comparing Genomes with Duplicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of the length of the longest increasing subsequence of random permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the repetition free longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of constrained longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the repetition free longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral heuristic for bisecting random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut approach to the repetition-free longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected length of the longest common subsequence for large alphabets / rank
 
Normal rank

Latest revision as of 04:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Repetition-free longest common subsequence of random sequences
scientific article

    Statements

    Identifiers