Comparing bacterial genomes from linear orders of patterns

DOI10.1016/J.DAM.2007.04.030MaRDI QIDQ947065zbMATHOpenAlexFDO

Authors Frédéric Guyon, Alain Guénoche

Publication date 29 September 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.04.030

zbMATH Keywords

genome comparisonlongest common circular chainsmaximal unique matchespyrococcus genomes

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Discrete mathematics in relation to computer science (68R99) Combinatorics on words (68R15) Computational methods for problems pertaining to biology (92-08)

Recommendations

• An Evolutionary Distance Based on Maximal Unique Matches
• On the similarity of sets of permutations and its applications to genome comparison
• New genome similarity measures based on conserved gene adjacencies
• Algorithms for Finding Gene Clusters
• Combinatorial Pattern Matching

Cites work

• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• scientific article; zbMATH DE number 1786450 (Why is no real title available?)
• scientific article; zbMATH DE number 3360173 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials
• A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
• A linear space algorithm for computing maximal common subsequences
• Algorithms on Strings, Trees and Sequences
• Compound Poisson approximation of word counts in DNA sequences
• Enumeration des tableaux Standards
• Estimating true evolutionary distances between genomes
• Experimental and statistical analysis of sorting by reversals
• Longest Increasing and Decreasing Subsequences
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• On the distribution of the length of the longest increasing subsequence of random permutations
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• Poisson approximations for runs and patterns of rare events
• The Complexity of Some Problems on Subsequences and Supersequences
• Transforming cabbage into turnip

Cited in

(2)

• `Genome order index' should not be used for defining compositional contraints in nucleotide sequences
• Comparative Genomics

Describes a project that uses

Uses Software

• MUMMER

This page was built for publication: Comparing bacterial genomes from linear orders of patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947065)