Abstract

The construction of a consistent protein chemical shift database is an important step toward making more extensive use of this data in structural studies. Unfortunately, progress in this direction has been hampered by the quality of the available data, particularly with respect to chemical shift referencing, which is often either inaccurate or inconsistently annotated. Preprocessing of the data is therefore required to detect and correct referencing errors. In an earlier study we developed CheckShift, a program for performing this task automatically. Now we spent substantial effort in improving the running time of the CheckShift algorithm, which resulted in an running time decrease of 90%, thereby achieving equivalent quality to the former version of CheckShift. The reason for the running time decrease is twofold. Firstly we improved the search for the optimal re-referencing offset considerably. Secondly, as CheckShift is based on a secondary structure prediction from the amino acid sequence (formally PsiPred was used), we evaluated a wide range of available secondary structure prediction programs focusing on the special needs of the CheckShift algorithm. The results of this evaluation prove empirically that we can use faster secondary structure prediction programs than PsiPred without sacrificing CheckShift's accuracy. Very recently Wang and Markley (2009) gave a small list of extreme outliers of the former version of the CheckShift web-server. Those were due to the empirical reduction of the search space implemented in the old version. The new version of CheckShift now gives very similar results to RefDB and LACS for all outliers mentioned in Table 1 of Wang and Markley (2009).

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.