Finding longest common segments in protein structures in nearly linear time

DOI10.1007/978-3-642-31265-6_27MaRDI QIDQ2904508zbMATH OpenOpenAlexFDO

Authors Yen Kaow Ng, Hirotaka Ono, Ling Ge, Shuai Cheng Li

Publication date 14 August 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-31265-6_27

Mathematics Subject Classification ID

Algorithms on strings (68W32) Analysis of algorithms (68W40) Protein sequences, DNA sequences (92D20)

Recommendations

• On protein structure alignment under distance constraint
• On protein structure alignment under distance constraint
• A Parameterized Algorithm for Protein Structure Alignment
• Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
• Constant time approximation scheme for largest well predicted subset

Cited in

(3)

• Finding Largest Well-Predicted Subset of Protein Structure Models
• Constant time approximation scheme for largest well predicted subset
• scientific article; zbMATH DE number 2239324 (Why is no real title available?)

This page was built for publication: Finding longest common segments in protein structures in nearly linear time

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