Comparing bacterial genomes from linear orders of patterns (Q947065): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.04.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061940465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / 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: Q5633999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximations for runs and patterns of rare events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration des tableaux Standards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compound Poisson approximation of word counts in DNA sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating true evolutionary distances between genomes / rank
 
Normal rank

Latest revision as of 17:47, 28 June 2024

scientific article
Language Label Description Also known as
English
Comparing bacterial genomes from linear orders of patterns
scientific article

    Statements

    Comparing bacterial genomes from linear orders of patterns (English)
    0 references
    0 references
    0 references
    29 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    genome comparison
    0 references
    maximal unique matches
    0 references
    longest common circular chains
    0 references
    pyrococcus genomes
    0 references
    0 references