Comparing bacterial genomes from linear orders of patterns

DOI10.1016/j.dam.2007.04.030zbMath1144.92328OpenAlexW2061940465MaRDI QIDQ947065

Alain Guénoche, Frédéric Guyon

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

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

Uses Software

• MUMMER

Cites Work

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

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