Clustering Near-Identical Sequences for Fast Homology Search

DOI10.1007/11732990_16MaRDI QIDQ3596311zbMATH OpenOpenAlexFDO

Authors Michael F. Cameron, Yaniv Bernstein, Hugh E. Williams

Publication date 30 August 2007

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

Full work available at URL https://doi.org/10.1007/11732990_16

zbMATH Keywords

fast homology searchnear-identical sequencesredundancysequence databanks

Mathematics Subject Classification ID

Genetics and epigenetics (92D10)

Recommendations

• scientific article; zbMATH DE number 1945900
• Optimized homology searches of the gene and protein sequence data banks
• Rapid homology search with neighbor seeds
• Parallelization of local BLAST service on workstation clusters
• Fast embedding methods for clustering tens of thousands of sequences

Cited in

(8)

• Fast embedding methods for clustering tens of thousands of sequences
• Sequence similarity ('homology') searching for molecular biologists
• Optimized homology searches of the gene and protein sequence data banks
• scientific article; zbMATH DE number 1945900 (Why is no real title available?)
• What's behind blast
• Better greedy sequence clustering with fast banded alignment
• Outlier detection in BLAST hits
• Efficient relaxed search in hierarchically clustered sequence datasets

This page was built for publication: Clustering Near-Identical Sequences for Fast Homology Search

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