1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278
|
/*
* Copyright (C) 2014-2021 Brian L. Browning
*
* This file is part of Beagle
*
* Beagle is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Beagle 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package vcf;
import ints.IndexArray;
import ints.IntArray;
import java.util.Arrays;
/**
* <p>Class {@code IntArrayRefGT} represents phased, non-missing
* genotypes for a list of reference samples at a single marker.
* Genotype emission probabilities are determined by the sample
* genotypes.
* </p>
* <p>Instances of class {@code IntArrayRefGT} are immutable.
* </p>
*
* @author Brian L. Browning {@code <browning@uw.edu>}
*/
public final class IntArrayRefGTRec implements RefGTRec {
private final Marker marker;
private final Samples samples;
private final IntArray alleles;
/**
* Constructs a new {@code IntArrayRefGT} instance from the
* specified phased genotype data.
* @param marker the marker
* @param samples the list of samples
* @param alleles the list of phased alleles
* @throws IllegalArgumentException if
* {@code alleles.length != 2*samples.size()}
* @throws IllegalArgumentException if
* {@code (alleles[j] < 0 || alleles[j] >= marker.nAlleles())} for any
* {@code j} satisfying {@code 0 <= j && j < allele1.length}
* @throws NullPointerException if
* {@code marker==null || samples==null || alleles==null}
*/
public IntArrayRefGTRec(Marker marker, Samples samples, int[] alleles) {
if (alleles.length != 2*samples.size()) {
throw new IllegalArgumentException(String.valueOf(alleles.length));
}
int nAlleles = marker.nAlleles();
for (int a : alleles) {
if (a<0 || a>=nAlleles) {
throw new IllegalArgumentException(String.valueOf(a));
}
}
this.marker = marker;
this.samples = samples;
this.alleles = IntArray.packedCreate(alleles, marker.nAlleles());
}
/**
* Constructs a new {@code IntArrayRefGT} instance from the
* specified phased genotype data.
* @param marker the marker
* @param samples the list of samples
* @param alleles the list of phased alleles
* @throws IllegalArgumentException if
* {@code alleles.size() != 2*samples.size()}
* @throws IllegalArgumentException if
* {@code alleles.valueSize() >= marker.nAlleles()}
* @throws NullPointerException if
* {@code marker==null || samples==null || alleles==null}
*/
public IntArrayRefGTRec(Marker marker, Samples samples, IndexArray alleles) {
if (alleles.size() != 2*samples.size()) {
throw new IllegalArgumentException(String.valueOf(alleles.size()));
}
if (alleles.valueSize() > marker.nAlleles()) {
throw new IllegalArgumentException(String.valueOf(alleles.valueSize()));
}
this.marker = marker;
this.samples = samples;
this.alleles = alleles;
}
@Override
public boolean isPhased(int sample) {
if (sample < 0 || sample >= this.samples().size()) {
throw new IndexOutOfBoundsException(String.valueOf(sample));
}
return true;
}
/**
* Returns {@code true}.
* @return {@code true}
*/
@Override
public boolean isPhased() {
return true;
}
@Override
public boolean isAlleleCoded() {
return false;
}
@Override
public int majorAllele() {
return majorAllele(alleleCounts());
}
private int majorAllele(int[] alCnts) {
int majAl = 0;
for (int al=1; al<alCnts.length; ++al) {
if (alCnts[al]>alCnts[majAl]) {
majAl = al;
}
}
return majAl;
}
@Override
public int[] alleleCounts() {
int[] alCnts = new int[marker.nAlleles()];
for (int h=0, n=size(); h<n; ++h) {
++alCnts[get(h)];
}
return alCnts;
}
@Override
public int alleleCount(int allele) {
int[] alCnts = alleleCounts();
if (allele==majorAllele(alCnts)) {
throw new IllegalArgumentException("major allele");
}
else {
return alCnts[allele];
}
}
/**
* Returns the samples. The returned samples are the filtered samples
* after all sample exclusions.
*
* @return the samples.
*/
@Override
public Samples samples() {
return samples;
}
@Override
public int size() {
return 2*samples.size();
}
@Override
public Marker marker() {
return marker;
}
@Override
public int[][] alleleToHaps() {
int[] alCnts = alleleCounts();
int majAllele = 0;
for (int al=1; al<alCnts.length; ++al) {
if (alCnts[al] > alCnts[majAllele]) {
majAllele = al;
}
}
int[][] hapIndices = new int[alCnts.length][];
for (int al=0; al<alCnts.length; ++al) {
if (al!=majAllele) {
hapIndices[al] = new int[alCnts[al]];
}
}
Arrays.fill(alCnts, 0);
for (int h=0, n=size(); h<n; ++h) {
int al = get(h);
if (al!=majAllele) {
hapIndices[al][alCnts[al]++] = h;
}
}
return hapIndices;
}
@Override
public IndexArray hapToAllele() {
return new IndexArray(alleles, marker.nAlleles());
}
@Override
public int nAlleleCodedHaps() {
return nonNullCnt(alleleToHaps());
}
@Override
public int get(int hap) {
return alleles.get(hap);
}
@Override
public int hapIndex(int allele, int copy) {
int[][] hapIndices = alleleToHaps();
if (hapIndices[allele]==null) {
throw new IllegalArgumentException("major allele");
}
else {
return hapIndices[allele][copy];
}
}
@Override
public boolean isCarrier(int allele, int hap) {
return get(hap)==allele;
}
/**
* Returns the data represented by {@code this} as a VCF
* record with a GT format field. The returned VCF record
* will have missing QUAL and INFO fields, will have "PASS"
* in the filter field, and will have a GT format field.
* @return the data represented by {@code this} as a VCF
* record with a GT format field
*/
@Override
public String toString() {
return GTRec.toVcfRec(this);
}
@Override
public int nMaps() {
return 1;
}
@Override
public IntArray[] maps() {
return new IntArray[] {alleles};
}
@Override
public IntArray map(int index) {
if (index!=0) {
throw new IndexOutOfBoundsException(String.valueOf(index));
}
return alleles;
}
/**
* Returns the sum of the lengths of non-null rows of the specified
* two-dimensional array.
* @param alleleToHaps a two-dimensional array
* @return the sum of the lengths of non-null rows
* @throws NullPointerException if {@code alleleToHaps == null}
*/
public static int nonNullCnt(int[][] alleleToHaps) {
int nonNullCnt=0;
for (int[] ia : alleleToHaps) {
if (ia!=null) {
nonNullCnt += ia.length;
}
}
return nonNullCnt;
}
}
|