Sequence comparison. Theory and methods

DOI10.1007/978-1-84800-320-0zbMath1184.68256OpenAlexW4249771829MaRDI QIDQ947472

Kun-Mao Chao, Louxin Zhang

Publication date: 2 October 2008

Published in: Computational Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-84800-320-0

zbMATH Keywords

sequence comparisonalignment methodsspaced-seed technique

Mathematics Subject Classification ID

Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Optimal alignments of longest common subsequences and their path properties ⋮ Efficient retrieval of approximate palindromes in a run-length encoded string ⋮ An \(A^\ast\) search algorithm for the constrained longest common subsequence problem ⋮ On the generalized constrained longest common subsequence problems ⋮ Lower bounds for moments of global scores of pairwise Markov chains

This page was built for publication: Sequence comparison. Theory and methods