Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms
From MaRDI portal
Publication:5307502
DOI10.1007/11780441_15zbMath1196.68166OpenAlexW1492481632MaRDI QIDQ5307502
Publication date: 14 September 2007
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11780441_15
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)
Related Items (3)
Algorithms for subsequence combinatorics ⋮ Versatile string kernels ⋮ Near-optimal algorithm to count occurrences of subsequences of a given length
This page was built for publication: Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms
