-
-
Notifications
You must be signed in to change notification settings - Fork 69
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Reduce memory usage by GroupReadsByUmi in a corner case #774
Changes from 4 commits
ada649f
4175cf6
bcd8ff9
771c87a
d503ea1
84ef127
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -115,6 +115,12 @@ object GroupReadsByUmi { | |
/** Take in a sequence of UMIs and assign each UMI to a unique UMI group ID. */ | ||
def assign(rawUmis: Seq[Umi]) : Map[Umi, MoleculeId] | ||
|
||
/** Returns true if the two UMIs are the same. */ | ||
def isSameUmi(a: Umi, b: Umi): Boolean = a == b | ||
|
||
/** Returns a canonical form of the UMI that is the same for all reads with the same UMI. */ | ||
def canonicalize(u: Umi): Umi = u | ||
|
||
/** Default implementation of a method to retrieve the next ID based on a counter. */ | ||
protected def nextId: MoleculeId = this.counter.getAndIncrement().toString | ||
|
||
|
@@ -259,13 +265,35 @@ object GroupReadsByUmi { | |
/** String that is prefixed onto the UMI from the read with that maps to a higher coordinate in the genome.. */ | ||
private[umi] val higherReadUmiPrefix: String = ("b" * (maxMismatches+1)) + ":" | ||
|
||
|
||
/** Returns true if the two UMIs are the same. */ | ||
final override def isSameUmi(a: Umi, b: Umi): Boolean = { | ||
if (a == b) true else { | ||
val (a1, a2) = split(a) | ||
tfenne marked this conversation as resolved.
Show resolved
Hide resolved
|
||
val (b1, b2) = split(b) | ||
a1 == b2 && a2 == b1 | ||
} | ||
} | ||
|
||
/** Returns the UMI with the lexically lower half first. */ | ||
override def canonicalize(u: Umi): Umi = { | ||
val (a, b) = split(u) | ||
if (a < b) u else s"${b}-${a}" | ||
} | ||
|
||
/** Splits the paired UMI into it's two parts. */ | ||
tfenne marked this conversation as resolved.
Show resolved
Hide resolved
|
||
@inline private def split(umi: Umi): (Umi, Umi) = { | ||
val index = umi.indexOf('-') | ||
if (index == -1) throw new IllegalStateException(s"UMI $umi is not a paired UMI.") | ||
val first = umi.substring(0, index) | ||
val second = umi.substring(index+1, umi.length) | ||
(first, second) | ||
} | ||
|
||
/** Takes a UMI of the form "A-B" and returns "B-A". */ | ||
def reverse(umi: Umi): Umi = umi.indexOf('-') match { | ||
case -1 => throw new IllegalStateException(s"UMI $umi is not a paired UMI.") | ||
case i => | ||
val first = umi.substring(0, i) | ||
val second = umi.substring(i+1, umi.length) | ||
second + '-' + first | ||
def reverse(umi: Umi): Umi = { | ||
val (first, second) = split(umi) | ||
s"${second}-${first}" | ||
} | ||
|
||
/** Turns each UMI into the lexically earlier of A-B or B-A and then counts them. */ | ||
|
@@ -441,6 +469,17 @@ class GroupReadsByUmi | |
|
||
private val assigner = strategy.newStrategy(this.edits) | ||
|
||
/** True if no differences in UMIs are tolerated and the Molecular ID tag is MI, false otherwise. True here enables | ||
* an optimization where, when bringing groups of reads into memory, we can _also_ group by UMI thus | ||
* reducing the number in memory. This is helpful since edits=0 is often used for data that has | ||
tfenne marked this conversation as resolved.
Show resolved
Hide resolved
|
||
* high numbers of reads with the same start/stop coordinates. | ||
* We do this be setting the MI tag to the canonicalized, (optionally truncated) UMI prior to sorting, so that | ||
tfenne marked this conversation as resolved.
Show resolved
Hide resolved
|
||
* reads with the same UMI are grouped together in the sorted stream of records. | ||
*/ | ||
private val canTakeNextGroupByUmi = | ||
(this.assignTag == ConsensusTags.MolecularId) && | ||
(this.edits == 0 || this.strategy == Strategy.Identity) | ||
|
||
/** Checks that the read's mapq is over a minimum, and if the read is paired, that the mate mapq is also over the min. */ | ||
private def mapqOk(rec: SamRecord, minMapQ: Int): Boolean = { | ||
val mateMqOk = if (rec.unpaired) true else rec.get[Int](SAMTag.MQ.name()) match { | ||
|
@@ -480,7 +519,24 @@ class GroupReadsByUmi | |
} | ||
} || { filterUmisTooShort += 1; false} | ||
} | ||
.foreach(r => { sorter += r; kept += 1; sortProgress.record(r) }) | ||
.foreach { r => | ||
// If we're able to also group by the UMI because edits aren't allowed, push the trimmed, canonicalized UMI | ||
// into the assign tag (which must be MI if cantakeNextGroupByUmi is true), since that is used by the | ||
// SamOrder to sort the reads _and_ we'll overwrite it on the way out! | ||
tfenne marked this conversation as resolved.
Show resolved
Hide resolved
|
||
if (this.canTakeNextGroupByUmi) { | ||
val umi = this.assigner.canonicalize(r[String](rawTag).toUpperCase) | ||
val truncated = this.minUmiLength match { | ||
case None => umi | ||
case Some(n) => umi.substring(0, n) | ||
} | ||
|
||
r(this.assignTag) = truncated | ||
} | ||
|
||
sorter += r | ||
kept += 1 | ||
sortProgress.record(r) | ||
} | ||
|
||
logger.info(f"Accepted $kept%,d reads for grouping.") | ||
if (filteredNonPf > 0) logger.info(f"Filtered out $filteredNonPf%,d non-PF reads.") | ||
|
@@ -531,11 +587,22 @@ class GroupReadsByUmi | |
|
||
/** Consumes the next group of templates with all matching end positions and returns them. */ | ||
def takeNextGroup(iterator: BufferedIterator[Template]) : Seq[Template] = { | ||
val first = iterator.next() | ||
val first = iterator.next() | ||
val firstEnds = ReadInfo(first.r1.getOrElse(fail(s"R1 missing for template ${first.name}"))) | ||
val buffer = ListBuffer[Template]() | ||
while (iterator.hasNext && firstEnds == ReadInfo(iterator.head.r1.get)) buffer += iterator.next() | ||
first :: buffer.toList | ||
val firstUmi = first.r1.get.apply[String](this.assignTag) | ||
val builder = IndexedSeq.newBuilder[Template] | ||
builder += first | ||
|
||
while ( | ||
iterator.hasNext && | ||
firstEnds == ReadInfo(iterator.head.r1.get) && | ||
// This last condition only works because we put a canonicalized UMI into rec(assignTag) if canTakeNextGroupByUmi | ||
(!canTakeNextGroupByUmi || firstUmi == iterator.head.r1.get.apply[String](this.assignTag)) | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. So this does change behavior in a subtle way. Suppose we have three templates that have all but the same assign tag. Let's say Previously, all templates would be read into memory, and In the new implementation, we truncate the raw UMI bases based on One could argue that the new implementation is an improvement, but it does change behavior subtly. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Hrm, that is an interesting point. So basically if you have variable length single UMIs and have edits = 0 the behavior will be subtly different. My instinct is to call this an improvement and move on, but I don't have a great sense of who (or on what kind of data) the variable length support is used, so I'm not 100% sure. |
||
) { | ||
builder += iterator.next() | ||
} | ||
|
||
builder.result() | ||
} | ||
|
||
/** | ||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Apologies for the unrelated change here. I had a stupid type that took me far too long to figure out because I used
-u
instead of-U
andCorrectUmis
happily decided my filename was the sole UMI sequence to correct to. It the message here had told me my expcted UMI length was 30+ that would have helped!