object CorrectUmis
- Alphabetic
- By Inheritance
- CorrectUmis
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
case class
UmiCorrectionMetrics
(umi: String, total_matches: Long = 0, perfect_matches: Long = 0, one_mismatch_matches: Long = 0, two_mismatch_matches: Long = 0, other_matches: Long = 0, fraction_of_matches: Double = 0, representation: Double = 0) extends Metric with Product with Serializable
Metrics for the correction of UMI sequences to a fixed set of known UMIs.
Metrics for the correction of UMI sequences to a fixed set of known UMIs.
- umi
the corrected UMI sequence (or all Ns for unmatched)
- total_matches
the number of UMI sequences that matched/were corrected to this UMI
- perfect_matches
the number of UMI sequences that were perfect matches to this UMI
- one_mismatch_matches
the number of UMI sequences that matched with a single mismatch
- two_mismatch_matches
the number of UMI sequences that matched with two mismatches
- other_matches
the number of UMI sequences that matched with > 2 mismatches
- fraction_of_matches
the fraction of all UMIs that matched or were corrected to this UMI
- representation
the total_matches for this UMI divided by the mean total_matches for all UMIs
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
findUmiPairsWithinDistance(umis: Seq[String], distance: Int): Seq[(String, String, Int)]
Finds pairs of UMIs within the given set that are within some edit distance of each other.
Finds pairs of UMIs within the given set that are within some edit distance of each other.
- umis
the set of umis to check
- distance
the maximum edit distance at which to report pairs of UMIs
- returns
a Seq of three-tuples containing (umi1, umi2, edit_distance)
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )