Efficient Alignment Free Sequence Comparison with Bounded Mismatches

DOI10.1007/978-3-319-16706-0_1MaRDI QIDQ2814576zbMATH OpenOpenAlexFDO

Authors Srinivas Aluru, Alberto Apostolico, Sharma V. Thankachan

Publication date 22 June 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-16706-0_1

zbMATH Keywords

average common substringHamming distancephotogenic reconstruction

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40) Problems related to evolution (92D15)

Recommendations

• Alignment-free sequence comparison for biologically realistic sequences of moderate length
• Alignment-free sequence comparison with spaced k-mers.
• Alignment-free comparison of genome sequences by a new numerical characterization
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Lower bounds for optimal alignments of binary sequences
• Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
• Implementation and Application of Automata

Cited in

(11)

• Bounds for parametric sequence comparison
• New powerful statistics for alignment-free sequence comparison under a pattern transfer model
• Extraction of high quality \(k\)-words for alignment-free sequence comparison
• Sequence comparison with mixed convex and concave costs
• Alignment-free sequence comparison for biologically realistic sequences of moderate length
• On computing average common substring over run length encoded sequences
• Alignment-free sequence comparison with spaced k-mers.
• Analysis of the Period Recovery Error Bound
• Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
• Efficient computation of sequence mappability
• Longest common substring with gaps and related problems

This page was built for publication: Efficient Alignment Free Sequence Comparison with Bounded Mismatches

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