Chaste Release::3.1
AbstractSimpleGenerationBasedCellCycleModel.cpp
00001 /*
00002 
00003 Copyright (c) 2005-2012, University of Oxford.
00004 All rights reserved.
00005 
00006 University of Oxford means the Chancellor, Masters and Scholars of the
00007 University of Oxford, having an administrative office at Wellington
00008 Square, Oxford OX1 2JD, UK.
00009 
00010 This file is part of Chaste.
00011 
00012 Redistribution and use in source and binary forms, with or without
00013 modification, are permitted provided that the following conditions are met:
00014  * Redistributions of source code must retain the above copyright notice,
00015    this list of conditions and the following disclaimer.
00016  * Redistributions in binary form must reproduce the above copyright notice,
00017    this list of conditions and the following disclaimer in the documentation
00018    and/or other materials provided with the distribution.
00019  * Neither the name of the University of Oxford nor the names of its
00020    contributors may be used to endorse or promote products derived from this
00021    software without specific prior written permission.
00022 
00023 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
00024 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00025 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00026 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
00027 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
00028 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
00029 GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
00030 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00031 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
00032 OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00033 
00034 */
00035 
00036 #include "AbstractSimpleGenerationBasedCellCycleModel.hpp"
00037 
00038 AbstractSimpleGenerationBasedCellCycleModel::AbstractSimpleGenerationBasedCellCycleModel()
00039     : AbstractSimpleCellCycleModel(),
00040       mGeneration(0),
00041       mMaxTransitGenerations(3) // taken from Meineke et al, 2001 (doi:10.1046/j.0960-7722.2001.00216.x)
00042 {
00043 }
00044 
00045 AbstractSimpleGenerationBasedCellCycleModel::~AbstractSimpleGenerationBasedCellCycleModel()
00046 {
00047 }
00048 
00049 void AbstractSimpleGenerationBasedCellCycleModel::ResetForDivision()
00050 {
00051     mGeneration++;
00052     if (mGeneration > mMaxTransitGenerations)
00053     {
00054         mpCell->SetCellProliferativeType(DIFFERENTIATED);
00055     }
00056     if (mpCell->GetCellProliferativeType() == STEM)
00057     {
00058         mGeneration = 0;
00059     }
00060     AbstractSimpleCellCycleModel::ResetForDivision();
00061 }
00062 
00063 void AbstractSimpleGenerationBasedCellCycleModel::InitialiseDaughterCell()
00064 {
00065     /*
00066      * If the parent cell is a stem cell then its generation was reset
00067      * to zero when ResetForDivision() was called. The daughter cell's
00068      * generation must therefore be incremented here.
00069      */
00070     if (mGeneration == 0)
00071     {
00072         mGeneration = 1;
00073     }
00074     /*
00075      * In generation-based cell-cycle models, the daughter cell
00076      * is always of type transit or differentiated.
00077      */
00078     mpCell->SetCellProliferativeType(TRANSIT);
00079     if (mGeneration > mMaxTransitGenerations)
00080     {
00081         mpCell->SetCellProliferativeType(DIFFERENTIATED);
00082     }
00083     AbstractSimpleCellCycleModel::InitialiseDaughterCell();
00084 }
00085 
00086 void AbstractSimpleGenerationBasedCellCycleModel::SetGeneration(unsigned generation)
00087 {
00088     mGeneration = generation;
00089 }
00090 
00091 unsigned AbstractSimpleGenerationBasedCellCycleModel::GetGeneration() const
00092 {
00093     return mGeneration;
00094 }
00095 
00096 void AbstractSimpleGenerationBasedCellCycleModel::SetMaxTransitGenerations(unsigned maxTransitGenerations)
00097 {
00098     mMaxTransitGenerations = maxTransitGenerations;
00099 }
00100 
00101 unsigned AbstractSimpleGenerationBasedCellCycleModel::GetMaxTransitGenerations() const
00102 {
00103     return mMaxTransitGenerations;
00104 }
00105 
00106 void AbstractSimpleGenerationBasedCellCycleModel::OutputCellCycleModelParameters(out_stream& rParamsFile)
00107 {
00108     *rParamsFile << "\t\t\t<MaxTransitGenerations>" << mMaxTransitGenerations << "</MaxTransitGenerations>\n";
00109 
00110     // Call method on direct parent class
00111     AbstractSimpleCellCycleModel::OutputCellCycleModelParameters(rParamsFile);
00112 }