findOverlaps-methods function - RDocumentation (original) (raw)
findOverlaps-methods: Finding overlapping ranges
Description
Various methods for finding/counting interval overlaps between two "range-based" objects: a query and a subject.
NOTE: This man page describes the methods that operate on Ranges,Views, RangesList, or ViewsList objects. See?`[findOverlaps,GenomicRanges,GenomicRanges-method](/link/findOverlaps%2CGenomicRanges%2CGenomicRanges-method?package=IRanges&version=2.6.1&to=GenomicRanges)`
in the GenomicRanges package for methods that operate onGenomicRanges or GRangesList objects.
Usage
findOverlaps(query, subject, maxgap=0L, minoverlap=1L, type=c("any", "start", "end", "within", "equal"), select=c("all", "first", "last", "arbitrary"), ...)
countOverlaps(query, subject, maxgap=0L, minoverlap=1L, type=c("any", "start", "end", "within", "equal"), ...)
overlapsAny(query, subject, maxgap=0L, minoverlap=1L, type=c("any", "start", "end", "within", "equal"), ...) query %over% subject query %within% subject query %outside% subject
subsetByOverlaps(query, subject, maxgap=0L, minoverlap=1L, type=c("any", "start", "end", "within", "equal"), ...)
mergeByOverlaps(query, subject, ...) findOverlapPairs(query, subject, ...)
"ranges"(x, query, subject) "ranges"(x, query, subject)
Arguments
query, subject
Each of them can be a Ranges, Views, RangesList,ViewsList, or RangedData object. In addition, if subject
is a Ranges object, query
can be an integer vector to be converted to length-one ranges.
If query
is a RangesList or RangedData,subject
must be a RangesList or RangedData. If both lists have names, each element from the subject is paired with the element from the query with the matching name, if any. Otherwise, elements are paired by position. The overlap is then computed between the pairs as described below.
If subject
is omitted, query
is queried against itself. In this case, and only this case, the drop.self
and drop.redundant
arguments are allowed. By default, the result will contain hits for each range against itself, and if there is a hit from A to B, there is also a hit for B to A. Ifdrop.self
is TRUE
, all self matches are dropped. Ifdrop.redundant
is TRUE
, only one of A->B and B->A is returned.
maxgap, minoverlap
Intervals with a separation of maxgap
or less and a minimum of minoverlap
overlapping positions, allowing formaxgap
, are considered to be overlapping. maxgap
should be a scalar, non-negative, integer. minoverlap
should be a scalar, positive integer.
type
By default, any overlap is accepted. By specifying the type
parameter, one can select for specific types of overlap. The types correspond to operations in Allen's Interval Algebra (see references). If type
is start
or end
, the intervals are required to have matching starts or ends, respectively. While this operation seems trivial, the naive implementation using outer
would be much less efficient. Specifying equal
as the type returns the intersection of the start
and end
matches. Iftype
is within
, the query interval must be wholly contained within the subject interval. Note that all matches must additionally satisfy the minoverlap
constraint described above.
The maxgap
parameter has special meaning with the special overlap types. For start
, end
, and equal
, it specifies the maximum difference in the starts, ends or both, respectively. For within
, it is the maximum amount by which the subject may be wider than the query.
select
If query
is a Ranges or Views object: When select
is "all"
(the default), the results are returned as a Hits object. Otherwise the returned value is an integer vector parallel to query
(i.e. same length) containing the first, last, or arbitrary overlapping interval in subject
, with NA
indicating intervals that did not overlap any intervals in subject
.
If query
is a RangesList, ViewsList, orRangedData object: When select
is "all"
(the default), the results are returned as a HitsList object. Otherwise the returned value depends on the drop
argument. When select != "all" && !drop
, an IntegerList is returned, where each element of the result corresponds to a space in query
. When select != "all" && drop
, an integer vector is returned containing indices that are offset to align with the unlisted query
.
...
Further arguments to be passed to or from other methods:
drop
: Supported only whenquery
is aRangesList, ViewsList, or RangedData object.FALSE
by default. Seeselect
argument above for the details.drop.self
,drop.redundant
: Whensubject
is omitted, thedrop.self
anddrop.redundant
arguments (bothFALSE
by default) are allowed. Seequery
andsubject
arguments above for the details.
Value
For findOverlaps
: see select
argument above.For countOverlaps
: the overlap hit count for each range in query
using the specified findOverlaps
parameters. For RangesList objects, it returns an IntegerList object.overlapsAny
finds the ranges in query
that overlap any of the ranges in subject
. For Ranges or Views objects, it returns a logical vector of length equal to the number of ranges in query
. For RangesList, RangedData, orViewsList objects, it returns a LogicalList object, where each element of the result corresponds to a space in query
.%over%
and %within%
are convenience wrappers for the 2 most common use cases. Currently defined as`%over%` <- function(query, subject) overlapsAny(query, subject)
and`%within%` <- function(query, subject) overlapsAny(query, subject, type="within")
. %outside%
is simply the inverse of %over%
.subsetByOverlaps
returns the subset of query
that has an overlap hit with a range in subject
using the specifiedfindOverlaps
parameters.mergeByOverlaps
computes the overlap between query and subject according to the arguments in ...
. It then extracts the corresponding hits from each object and returns a DataFrame
containing one column for the query and one for the subject, as well as any mcols
that were present on either object. The query and subject columns are named by quoting and deparsing the corresponding argument.findOverlapPairs
is like mergeByOverlaps
, except it returns a formal [Pairs](/link/Pairs?package=IRanges&version=2.6.1&to=S4Vectors%3APairs-class)
object that provides useful downstream conveniences, such as finding the intersection of the overlapping ranges with [pintersect](/link/pintersect?package=IRanges&version=2.6.1)
.When x
is a Hits (or HitsList) object, ranges(x, query, subject)
returns a Ranges (or RangesList) object of the same shape as x
holding the regions of intersection between the overlapping ranges in objects query
and subject
, which should be the same query and subject used in the call to findOverlaps
that generatedx
.Same shape means same length when x
is aHits object, and same length and same elementNROWS when x
is a HitsList object.
Details
A common type of query that arises when working with intervals is finding which intervals in one set overlap those in another.
The simplest approach is to call the findOverlaps
function on a Ranges or other object with range information (aka "range-based object").
References
Allen's Interval Algebra: James F. Allen: Maintaining knowledge about temporal intervals. In: Communications of the ACM. 26/11/1983. ACM Press. S. 832-843, ISSN 0001-0782
See Also
- Hits and HitsList objects in the S4Vectors package for representing a set of hits between 2 vector-like or list-like objects.
- findOverlaps,GenomicRanges,GenomicRanges-method in the GenomicRanges package for methods that operate onGRanges or GRangesList objects.
- The NCList class and constructor.
- The Ranges, Views, RangesList, andViewsList classes.
- The IntegerList and LogicalList classes.
Examples
query <- IRanges(c(1, 4, 9), c(5, 7, 10))
subject <- IRanges(c(2, 2, 10), c(2, 3, 12))
## ---------------------------------------------------------------------
## findOverlaps()
## ---------------------------------------------------------------------
## at most one hit per query
findOverlaps(query, subject, select="first")
findOverlaps(query, subject, select="last")
findOverlaps(query, subject, select="arbitrary")
## overlap even if adjacent only
## (FIXME: the gap between 2 adjacent ranges should be still considered
## 0. So either we have an argument naming problem, or we should modify
## the handling of the 'maxgap' argument so that the user would need to
## specify maxgap=0L to obtain the result below.)
findOverlaps(query, subject, maxgap=1L)
## shortcut
findOverlaps(query, subject)
query <- IRanges(c(1, 4, 9), c(5, 7, 10))
subject <- IRanges(c(2, 2), c(5, 4))
## one Ranges with itself
findOverlaps(query)
## single points as query
subject <- IRanges(c(1, 6, 13), c(4, 9, 14))
findOverlaps(c(3L, 7L, 10L), subject, select="first")
## alternative overlap types
query <- IRanges(c(1, 5, 3, 4), width=c(2, 2, 4, 6))
subject <- IRanges(c(1, 3, 5, 6), width=c(4, 4, 5, 4))
findOverlaps(query, subject, type="start")
findOverlaps(query, subject, type="start", maxgap=1L)
findOverlaps(query, subject, type="end", select="first")
ov <- findOverlaps(query, subject, type="within", maxgap=1L)
ov
## Using pairs to find intersection of overlapping ranges
hits <- findOverlaps(query, subject)
p <- Pairs(query, subject, hits=hits)
pintersect(p)
## Shortcut
p <- findOverlapPairs(query, subject)
pintersect(p)
## ---------------------------------------------------------------------
## overlapsAny()
## ---------------------------------------------------------------------
overlapsAny(query, subject, type="start")
overlapsAny(query, subject, type="end")
query %over% subject # same as overlapsAny(query, subject)
query %within% subject # same as overlapsAny(query, subject,
# type="within")
## ---------------------------------------------------------------------
## "ranges" METHODS FOR Hits OR HitsList OBJECTS
## ---------------------------------------------------------------------
## extract the regions of intersection between the overlapping ranges
ranges(ov, query, subject)
## ---------------------------------------------------------------------
## Using RangesList objects
## ---------------------------------------------------------------------
query <- IRanges(c(1, 4, 9), c(5, 7, 10))
qpartition <- factor(c("a","a","b"))
qlist <- split(query, qpartition)
subject <- IRanges(c(2, 2, 10), c(2, 3, 12))
spartition <- factor(c("a","a","b"))
slist <- split(subject, spartition)
## at most one hit per query
findOverlaps(qlist, slist, select="first")
findOverlaps(qlist, slist, select="last")
findOverlaps(qlist, slist, select="arbitrary")
query <- IRanges(c(1, 5, 3, 4), width=c(2, 2, 4, 6))
qpartition <- factor(c("a","a","b","b"))
qlist <- split(query, qpartition)
subject <- IRanges(c(1, 3, 5, 6), width=c(4, 4, 5, 4))
spartition <- factor(c("a","a","b","b"))
slist <- split(subject, spartition)
overlapsAny(qlist, slist, type="start")
overlapsAny(qlist, slist, type="end")
qlist
subsetByOverlaps(qlist, slist)
countOverlaps(qlist, slist)
Run the code above in your browser using DataLab