Algorithms and Computation
From MaRDI portal
Publication:5897905
DOI10.1007/11602613zbMath1175.68537OpenAlexW2304246803MaRDI QIDQ5897905
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)
Related Items (3)
MINING APPROXIMATE REPEATING PATTERNS FROM SEQUENCE DATA WITH GAP CONSTRAINTS ⋮ Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data ⋮ Maximal and minimal representations of gapped and non-gapped motifs of a string
This page was built for publication: Algorithms and Computation
