Efficient relaxed search in hierarchically clustered sequence datasets

DOI10.1145/2133803.2212315zbMATH Open1284.68630OpenAlexW2158898456MaRDI QIDQ5406261

Kai C. Bader, Christian Grothoff, Mikhail J. Atallah

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2133803.2212315

zbMATH Keywords

treesignaturedata miningphylogeneticoligonucleotideribosomal RNAprobe designprimer design

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Information storage and retrieval of data (68P20)

Related Items (1)

Title not available (Why is that?)

This page was built for publication: Efficient relaxed search in hierarchically clustered sequence datasets

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