Finding Largest Well-Predicted Subset of Protein Structure Models

DOI10.1007/978-3-540-69068-9_7MaRDI QIDQ3506941zbMATH OpenOpenAlexFDO

Authors Shuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69068-9_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Biochemistry, molecular biology (92C40)

Recommendations

• Constant time approximation scheme for largest well predicted subset
• Constant time approximation scheme for largest well predicted subset
• On protein structure alignment under distance constraint
• On protein structure alignment under distance constraint
• Finding longest common segments in protein structures in nearly linear time

Cites work

• An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
• Combinatorial Pattern Matching
• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
• scientific article; zbMATH DE number 1670646 (Why is no real title available?)
• scientific article; zbMATH DE number 2130513 (Why is no real title available?)

Cited in

(3)

• Constant time approximation scheme for largest well predicted subset
• Constant time approximation scheme for largest well predicted subset
• On protein structure alignment under distance constraint

This page was built for publication: Finding Largest Well-Predicted Subset of Protein Structure Models

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