Debian Codegraph @

src/java/org/broadinstitute/dropseqrna/barnyard/digitalallelecounts/sampleassignment/multisample/FindOptimalDonorMixture.java

raw
1 /*
2 * MIT License
3 *
4 * Copyright 2017 Broad Institute
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
22 * SOFTWARE.
23 */
24 package org.broadinstitute.dropseqrna.barnyard.digitalallelecounts.sampleassignment.multisample;
25
26 import java.util.ArrayList;
27 import java.util.Arrays;
28 import java.util.Collection;
29 import java.util.List;
30
31 import org.apache.commons.collections4.CollectionUtils;
32
33 /**
34 * Given a cell's worth of data, a sample to test as donor 1, and a list of samples to test as other donors,
35 * Test each sample pair and get a likelihood for the optimial mixture vs each individual in the pair.
36 * @author nemesh
37 *
38 */
39 public class FindOptimalDonorMixture {
40
41 private final VariantDataFactory factory;
42
43 public FindOptimalDonorMixture(final VariantDataFactory f) {
44 this.factory=f;
45 }
46
47 public AllPairedSampleAssignmentsForCell findBestDonorPair (final String sampleOne, final List<String> allSamples, final boolean scaleLikelihoods) {
48 return findBestDonorPair(sampleOne, allSamples, null, scaleLikelihoods);
49 }
50
51
52 public AllPairedSampleAssignmentsForCell findBestDonorPair (final String sampleOne, final List<String> allSamples, final Double forcedMixture, final boolean scaleLikelihoods) {
53 Collection<String> otherSamples = getNonPrimarySamples(sampleOne, allSamples);
54 AllPairedSampleAssignmentsForCell result = new AllPairedSampleAssignmentsForCell(factory.getCell(), scaleLikelihoods);
55 for (String sampleTwo: otherSamples) {
56 VariantDataCollection vdc= factory.getVariantData(sampleOne, sampleTwo);
57 SamplePairAssignmentForCell pair = vdc.optimizeMixture(forcedMixture);
58 result.add(pair);
59 }
60 return result;
61 }
62
63 /* This is damn slow. */
64 /*
65 public AllPairedSampleAssignmentsForCell findBestDonorPair (final String sampleOne, final List<String> allSamples, final Double forcedMixture) {
66 Collection<String> otherSamples = getNonPrimarySamples(sampleOne, allSamples);
67 AllPairedSampleAssignmentsForCell result = new AllPairedSampleAssignmentsForCell(factory.getCell());
68 otherSamples.stream().forEach(x -> result.add(computePair(sampleOne, x, forcedMixture)));
69 return result;
70 }
71
72 private SamplePairAssignmentForCell computePair (String sampleOne, String sampleTwo, final Double forcedMixture) {
73 VariantDataCollection vdc= this.factory.getVariantData(sampleOne, sampleTwo);
74 SamplePairAssignmentForCell pair = vdc.optimizeMixture(forcedMixture);
75 return (pair);
76 }
77 */
78
79 public static List<String> getNonPrimarySamples (final String sampleOne, final List<String> allSamples) {
80 return new ArrayList<>(CollectionUtils.subtract(allSamples, Arrays.asList(sampleOne)));
81 }
82
83
84
85
86 }