Abstract:
We show that multiple structure alignment (MStA) using contact maps is equivalent to the problem of finding a sample mean of contact maps. From this result, we derive a s...Show MoreMetadata
Abstract:
We show that multiple structure alignment (MStA) using contact maps is equivalent to the problem of finding a sample mean of contact maps. From this result, we derive a subgradient method for solving the MStA method. Experiments show that the proposed algorithm is a flexible alignment method that provides an excellent tradeoff between accuracy and speed.
Published in: 2009 International Joint Conference on Neural Networks
Date of Conference: 14-19 June 2009
Date Added to IEEE Xplore: 31 July 2009
ISBN Information:
ISSN Information:
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Multiple Sequence Alignment ,
- Sample Mean ,
- Alignment Method ,
- Subgradient Method ,
- Computation Time ,
- Sum Score ,
- Cost Function ,
- Standardized Mean ,
- Scoring Function ,
- Pairwise Alignment ,
- Solution Quality ,
- Matrix Representation ,
- Set Of Graphs ,
- Locally Lipschitz ,
- Optimal Alignment ,
- Lipschitz Function ,
- Ferritin Protein ,
- Alignment Problem ,
- Calmodulin-like Protein
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Multiple Sequence Alignment ,
- Sample Mean ,
- Alignment Method ,
- Subgradient Method ,
- Computation Time ,
- Sum Score ,
- Cost Function ,
- Standardized Mean ,
- Scoring Function ,
- Pairwise Alignment ,
- Solution Quality ,
- Matrix Representation ,
- Set Of Graphs ,
- Locally Lipschitz ,
- Optimal Alignment ,
- Lipschitz Function ,
- Ferritin Protein ,
- Alignment Problem ,
- Calmodulin-like Protein