PubMed Health⌕ Search

PubMed · 14623182

Structure-based active site profiles for genome analysis and functional family subclassification.

Abstract

In previous work, structure-based functional site descriptors, fuzzy functional forms (FFFs), were developed to recognize structurally conserved active sites in proteins. These descriptors identify members of protein families according to active-site structural similarity, rather than overall sequence or structure similarity. FFFs are defined by a minimal number of highly conserved residues and their three-dimensional arrangement. This approach is advantageous for function assignment across broad families, but is limited when applied to detailed subclassification within these families. In the work described here, we developed a method of three-dimensional, or structure-based, active-site profiling that utilizes FFFs to identify residues located in the spatial environment around the active site. Three-dimensional active-site profiling reveals similarities and differences among active sites across protein families. Using this approach, active-site profiles were constructed from known structures for 193 functional families, and these profiles were verified as distinct and characteristic. To achieve this result, a scoring function was developed that discriminates between true functional sites and those that are geometrically most similar, but do not perform the same function. In a large-scale retrospective analysis of human genome sequences, this profile score was shown to identify specific functional families correctly. The method is effective at recognizing the likely subtype of structurally uncharacterized members of the diverse family of protein kinases, categorizing sequences correctly that were misclassified by global sequence alignment methods. Subfamily information provided by this three-dimensional active-site profiling method yields key information for specific and selective inhibitor design for use in the pharmaceutical industry.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephen A Cammer, Brian T Hoffman, Jeffrey A Speir, Mary A Canady, Melanie R Nelson, Stacy Knutson, Marijo Gallina, Susan M Baxter, Jacquelyn S Fetrow. 2003-11-28. Structure-based active site profiles for genome analysis and functional family subclassification.. https://doi.org/10.1016/j.jmb.2003.09.062

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗