/*
* MarkovJumpsType.java
*
* Copyright (c) 2002-2015 Alexei Drummond, Andrew Rambaut and Marc Suchard
*
* This file is part of BEAST.
* See the NOTICE file distributed with this work for additional
* information regarding copyright ownership and licensing.
*
* BEAST is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* BEAST is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with BEAST; if not, write to the
* Free Software Foundation, Inc., 51 Franklin St, Fifth Floor,
* Boston, MA 02110-1301 USA
*/
package dr.inference.markovjumps;
/**
* @author Marc Suchard
* @author Vladimir Minin
* <p/>
* A base class for implementing Markov chain-induced counting processes (markovjumps) in BEAST using BEAGLE
* This work is supported by NSF grant 0856099
* <p/>
* Minin VN and Suchard MA (2008) Counting labeled transitions in continous-time Markov models of evolution.
* Journal of Mathematical Biology, 56, 391-412.
*/
public enum MarkovJumpsType {
HISTORY("history"),
COUNTS("counts"),
REWARDS("rewards");
MarkovJumpsType(String text) {
this.text = text;
}
public String getText() {
return text;
}
private final String text;
public static MarkovJumpsType parseFromString(String text) {
for (MarkovJumpsType scheme : MarkovJumpsType.values()) {
if (scheme.getText().compareToIgnoreCase(text) == 0)
return scheme;
}
return null;
}
}