A new combinatorial approach to sequence comparison
From MaRDI portal
Publication:2481558
Recommendations
- Theoretical Computer Science
- Combinatorial Pattern Matching
- Comparison of Symbol Sequences: No Editing, No Alignment
- The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform
- Alignment-free comparison of genome sequences by a new numerical characterization
Cites work
- A note on the Burrows-Wheeler transformation
- An extension of the Burrows-Wheeler transform
- Burrows-Wheeler transform and Sturmian words
- Clustering by Compression
- Combinatorial Pattern Matching
- Counting permutations with given cycle structure and descent set
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 1418325 (Why is no real title available?)
- Information distance
- The Similarity Metric
- Theoretical Computer Science
- Uniqueness Theorems for Periodic Functions
Cited in
(25)- Sequence comparison with concave weighting functions
- What can and what cannot be inferred from pairwise sequence comparisons?
- Bounds for parametric sequence comparison
- The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform
- A novel statistical measure for sequence comparison on the basis of \(k\)-word counts
- Phylogenetic analysis of DNA sequences based on \(k\)-word and rough set theory
- Alignment-free comparison of genome sequences by a new numerical characterization
- Comparison methods for branching and axillary flowering sequences
- When a dollar makes a BWT
- The alternating BWT: an algorithmic perspective
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Lightweight LCP construction for very large collections of strings
- Lightweight BWT construction for very large string collections
- scientific article; zbMATH DE number 2086238 (Why is no real title available?)
- On an alternative sequence comparison statistic of Steele
- Sequence comparison with mixed convex and concave costs
- Lightweight algorithms for constructing and inverting the BWT of string collections
- A new technique for comparing PBIBDs
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Sorting conjugates and suffixes of words in a multiset
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Theoretical Computer Science
- An efficient algorithm for sequence comparison with block reversals
- PhyBWT: alignment-free phylogeny via eBWT positional clustering
- Variable length local decoding and alignment-free sequence comparison
This page was built for publication: A new combinatorial approach to sequence comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481558)
