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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1261470
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Marcos A. Kiwi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1867483677 / rank
 
Normal rank
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 05:38, 12 July 2024

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

    Statements

    Repetition-free longest common subsequence of random sequences (English)
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    0 references
    repetition-free subsequence
    0 references
    common subsequence
    0 references
    random sequences
    0 references
    0 references
    0 references