期刊
JOURNAL OF COMPUTATIONAL BIOLOGY
卷 13, 期 8, 页码 1457-1464出版社
MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2006.13.1457
关键词
features; intervals; overlap computation; algorithm; implementation
Sets of biological features with genome coordinates ( e. g., genes and promoters) are a particularly common form of data in bioinformatics today. Accordingly, an increasingly important processing step involves comparing coordinates from large sets of features to find overlapping feature pairs. This paper presents fjoin, an efficient, robust, and simple algorithm for finding these pairs, and a downloadable implementation. For typical bioinformatics feature sets, fjoin requires O(n log( n)) time (O( n) if the inputs are sorted) and uses O(1) space. The reference implementation is a stand-alone Python program; it implements the basic algorithm and a number of useful extensions, which are also discussed in this paper.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据