Display Settings:

Format

Send to:

Choose Destination
    Rapid Commun Mass Spectrom. 2010 Sep;24(18):2689-96.

    Memory-efficient calculation of the isotopic mass states of a molecule.

    Source

    Department of Chemistry and Volen Center for Complex Systems, Brandeis University, Waltham, MA 02454, USA.

    Abstract

    Our previous work postulated a transition concept among different isotopic mass states (i.e., isotopic species) of a molecule, and developed a hierarchical algorithm for accurately calculating their masses and abundances. A theoretical mass spectrum can be generated by convoluting a peak shape function to these discrete mass states. This approach suffers from limited memory if a level in the hierarchical structure has too many mass states. Here we present a memory efficient divide-and-recursively-combine algorithm to do the calculation, which also improves the truncation method used in the previous hierarchical algorithm. Instead of treating all of the elements in a molecule as a whole, the new algorithm first 'strips' each element one by one. For the mass states of each element, a hierarchical structure is established and kept in the memory. This process reduces the memory usage by orders of magnitude (e.g., for bovine insulin, memory can be reduced from gigabytes to kilobytes). Next, a recursive algorithm is applied to combine mass states of elements to mass states of the whole molecule. The algorithm described above has been implemented as a computer program called Isotope Calculator, which was written in C++. It is freely available under the GNU Lesser General Public License from http://www.cs.brandeis.edu/~hong/software.html or http://people.brandeis.edu/~agar.

    2010 John Wiley & Sons, Ltd.

    PMID:
    20814974
    [PubMed - indexed for MEDLINE]

      Supplemental Content

      Icon for John Wiley & Sons, Inc.

      Save items

      loading

      Recent activity

      Your browsing activity is empty.

      Activity recording is turned off.

      Turn recording back on

      See more...
      Write to the Help Desk