Comparing bacterial genomes from linear orders of patterns
DOI10.1016/J.DAM.2007.04.030zbMATH Open1144.92328OpenAlexW2061940465MaRDI QIDQ947065FDOQ947065
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
Recommendations
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)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Longest Increasing and Decreasing Subsequences
- On the distribution of the length of the longest increasing subsequence of random permutations
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
- A Space-Economical Suffix Tree Construction Algorithm
- A linear space algorithm for computing maximal common subsequences
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- The Complexity of Some Problems on Subsequences and Supersequences
- Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
- Title not available (Why is that?)
- Compound Poisson approximation of word counts in DNA sequences
- Transforming cabbage into turnip
- Poisson approximations for runs and patterns of rare events
- Estimating true evolutionary distances between genomes
- Experimental and statistical analysis of sorting by reversals
- Title not available (Why is that?)
- Title not available (Why is that?)
- A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials
- Enumeration des tableaux Standards
Cited In (2)
Uses Software
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)