58 for (
size_t i = 0; i < species_.size(); ++i) {
68 for (
size_t i = 0; i < species_.size(); ++i) {
82 if (chr != currentChr_) {
87 if (refSeq.
start() < lastPosition_)
89 lastPosition_ = refSeq.
stop();
94 auto i = chrCodes_.find(chr);
95 if (i != chrCodes_.end()) {
98 unsigned int code = currentCode_++;
99 chrCodes_[chr] = code;
105 size_t offset = refSeq.
start();
110 if (refSeq[i] == gap)
116 if (refSeq[i] != gap) {
120 for (
size_t j = 0; j < alleles.size(); ++j) {
124 out << chrStr <<
"\t" << chr <<
"." << pos <<
"\t";
133 for (
size_t i = 0; i < ped_.size(); ++i)
134 out << ped_[i] << endl;
virtual int getGapCharacterCode() const=0
virtual std::string toString() const=0
virtual const Alphabet * getAlphabet() const=0
A synteny block data structure, the basic unit of a MAF alignement file.
bool hasSequenceForSpecies(const std::string &species) const
const MafSequence & getSequenceForSpecies(const std::string &species) const
A sequence class which is used to store data from MAF files.
std::string getDescription() const
const std::string & getChromosome() const
void parseBlock_(std::ostream &out, const MafBlock &block)
void writePedToFile_(std::ostream &out)
size_t getSequencePosition(size_t alnPos)
void addSequence(const Sequence &sequence, bool checkName=true)
const Site & getSite(size_t siteIndex) const
size_t getNumberOfSites() const
std::string toString(T t)