On protein structure alignment under distance constraint
From MaRDI portal
Publication:553356
DOI10.1016/j.tcs.2010.11.045zbMath1221.92042OpenAlexW2032410720MaRDI QIDQ553356
Publication date: 27 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.045
Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Unnamed Item
- Unnamed Item
- A method in graph theory
- Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Finding Largest Well-Predicted Subset of Protein Structure Models
- Planar 3DM is NP-complete
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: On protein structure alignment under distance constraint