| 36 | 1 #! /usr/bin/env python | 
|  | 2 # | 
|  | 3 # Copyright INRA-URGI 2009-2011 | 
|  | 4 # | 
|  | 5 # This software is governed by the CeCILL license under French law and | 
|  | 6 # abiding by the rules of distribution of free software. You can use, | 
|  | 7 # modify and/ or redistribute the software under the terms of the CeCILL | 
|  | 8 # license as circulated by CEA, CNRS and INRIA at the following URL | 
|  | 9 # "http://www.cecill.info". | 
|  | 10 # | 
|  | 11 # As a counterpart to the access to the source code and rights to copy, | 
|  | 12 # modify and redistribute granted by the license, users are provided only | 
|  | 13 # with a limited warranty and the software's author, the holder of the | 
|  | 14 # economic rights, and the successive licensors have only limited | 
|  | 15 # liability. | 
|  | 16 # | 
|  | 17 # In this respect, the user's attention is drawn to the risks associated | 
|  | 18 # with loading, using, modifying and/or developing or reproducing the | 
|  | 19 # software by the user in light of its specific status of free software, | 
|  | 20 # that may mean that it is complicated to manipulate, and that also | 
|  | 21 # therefore means that it is reserved for developers and experienced | 
|  | 22 # professionals having in-depth computer knowledge. Users are therefore | 
|  | 23 # encouraged to load and test the software's suitability as regards their | 
|  | 24 # requirements in conditions enabling the security of their systems and/or | 
|  | 25 # data to be ensured and, more generally, to use and operate it in the | 
|  | 26 # same conditions as regards security. | 
|  | 27 # | 
|  | 28 # The fact that you are presently reading this means that you have had | 
|  | 29 # knowledge of the CeCILL license and that you accept its terms. | 
|  | 30 # | 
|  | 31 from optparse import OptionParser | 
|  | 32 from commons.core.parsing.ParserChooser import ParserChooser | 
|  | 33 from commons.core.writer.TranscriptWriter import TranscriptWriter | 
|  | 34 from SMART.Java.Python.structure.Interval import Interval | 
|  | 35 from SMART.Java.Python.structure.Transcript import Transcript | 
|  | 36 from SMART.Java.Python.structure.Mapping import Mapping | 
|  | 37 from SMART.Java.Python.misc.Progress import Progress | 
|  | 38 from SMART.Java.Python.misc.UnlimitedProgress import UnlimitedProgress | 
|  | 39 | 
|  | 40 MINBIN = 3 | 
|  | 41 MAXBIN = 7 | 
|  | 42 REFERENCE = 0 | 
|  | 43 QUERY = 1 | 
|  | 44 | 
|  | 45 def getBin(start, end): | 
|  | 46 	for i in range(MINBIN, MAXBIN + 1): | 
|  | 47 		binLevel = 10 ** i | 
|  | 48 		if int(start / binLevel) == int(end / binLevel): | 
|  | 49 			return int(i * 10 ** (MAXBIN + 1) + int(start / binLevel)) | 
|  | 50 	return int((MAXBIN + 1) * 10 ** (MAXBIN + 1)) | 
|  | 51 | 
|  | 52 def getOverlappingBins(start, end): | 
|  | 53 	array	= [] | 
|  | 54 	bigBin = int((MAXBIN + 1) * 10 ** (MAXBIN + 1)) | 
|  | 55 	for i in range(MINBIN, MAXBIN + 1): | 
|  | 56 		binLevel = 10 ** i | 
|  | 57 		array.append((int(i * 10 ** (MAXBIN + 1) + int(start / binLevel)), int(i * 10 ** (MAXBIN + 1) + int(end / binLevel)))) | 
|  | 58 	array.append((bigBin, bigBin)) | 
|  | 59 	return array | 
|  | 60 | 
|  | 61 | 
|  | 62 class CompareOverlappingSmallQuery(object): | 
|  | 63 | 
|  | 64 	def __init__(self, verbosity): | 
|  | 65 		self.verbosity      = verbosity | 
|  | 66 		self.tableNames     = {} | 
|  | 67 		self.nbQueries      = 0 | 
|  | 68 		self.nbRefs	        = 0 | 
|  | 69 		self.nbWritten      = 0 | 
|  | 70 		self.nbOverlaps     = 0 | 
|  | 71 		self.distance       = None | 
|  | 72 		self.invert         = False | 
|  | 73 		self.antisense      = False | 
|  | 74 		self.collinear      = False | 
|  | 75 		self.pcOverlapQuery = False | 
|  | 76 		self.pcOverlapRef   = False | 
| 55 | 77 		self.minOverlap     = False | 
| 36 | 78 		self.bins	        = {} | 
|  | 79 		self.overlaps       = {} | 
|  | 80 		self.notOverlapping = False | 
|  | 81 | 
|  | 82 	def setReferenceFile(self, fileName, format): | 
|  | 83 		chooser = ParserChooser(self.verbosity) | 
|  | 84 		chooser.findFormat(format) | 
|  | 85 		self.refParser = chooser.getParser(fileName) | 
|  | 86 | 
|  | 87 	def setQueryFile(self, fileName, format): | 
|  | 88 		chooser = ParserChooser(self.verbosity) | 
|  | 89 		chooser.findFormat(format) | 
|  | 90 		self.queryParser = chooser.getParser(fileName) | 
|  | 91 | 
|  | 92 	def setOutputFile(self, fileName): | 
|  | 93 		self.writer = TranscriptWriter(fileName, "gff3", self.verbosity) | 
|  | 94 | 
|  | 95 	def setDistance(self, distance): | 
|  | 96 		self.distance = distance | 
|  | 97 | 
|  | 98 	def setInvert(self, boolean): | 
|  | 99 		self.invert = boolean | 
|  | 100 | 
|  | 101 	def setCollinear(self, boolean): | 
|  | 102 		self.collinear = boolean | 
|  | 103 | 
|  | 104 	def setAntisense(self, boolean): | 
|  | 105 		self.antisense = boolean | 
|  | 106 | 
|  | 107 	def setMinPercentOverlap(self, pcOverlapQuery, pcOverlapRef): | 
|  | 108 		self.pcOverlapQuery = pcOverlapQuery | 
|  | 109 		self.pcOverlapRef   = pcOverlapRef | 
|  | 110 | 
| 55 | 111 	def setMinOverlap(self, minOverlap): | 
|  | 112 		self.minOverlap = minOverlap | 
|  | 113 | 
| 36 | 114 	def includeNotOverlapping(self, boolean): | 
|  | 115 		self.notOverlapping = boolean | 
|  | 116 | 
|  | 117 	def loadQuery(self): | 
|  | 118 		progress = UnlimitedProgress(10000, "Reading queries", self.verbosity) | 
|  | 119 		for transcript in self.queryParser.getIterator(): | 
|  | 120 			if transcript.__class__.__name__ == "Mapping": | 
|  | 121 				transcript = transcript.getTranscript() | 
|  | 122 			chromosome = transcript.getChromosome() | 
|  | 123 			bin		   = getBin(transcript.getStart(), transcript.getEnd()) | 
|  | 124 			if chromosome not in self.bins: | 
|  | 125 				self.bins[chromosome] = {} | 
|  | 126 			if bin not in self.bins[chromosome]: | 
|  | 127 				self.bins[chromosome][bin] = [] | 
|  | 128 			self.bins[chromosome][bin].append(transcript) | 
|  | 129 			if self.notOverlapping or self.invert: | 
|  | 130 				self.overlaps[transcript] = {} | 
|  | 131 			self.nbQueries += 1 | 
|  | 132 			progress.inc() | 
|  | 133 		progress.done() | 
|  | 134 | 
|  | 135 	def _compareTwoTranscripts(self, queryTranscript, refTranscript): | 
|  | 136 		if not queryTranscript.overlapWithExon(refTranscript): | 
|  | 137 			return False | 
|  | 138 		if self.collinear and queryTranscript.getDirection() != refTranscript.getDirection(): | 
|  | 139 			return False | 
|  | 140 		if self.antisense and queryTranscript.getDirection() == refTranscript.getDirection(): | 
|  | 141 			return False | 
| 55 | 142 		if self.minOverlap and not queryTranscript.overlapWithExon(refTranscript, self.minOverlap): | 
|  | 143 			return False | 
| 36 | 144 		querySize = queryTranscript.getSize() | 
|  | 145 		if self.pcOverlapQuery and not queryTranscript.overlapWithExon(refTranscript, int(querySize * self.pcOverlapQuery / 100.0)): | 
|  | 146 			return False | 
|  | 147 		refSize = refTranscript.getSize() | 
|  | 148 		if self.pcOverlapRef and not queryTranscript.overlapWithExon(refTranscript, int(refSize * self.pcOverlapRef / 100.0)): | 
|  | 149 			return False | 
|  | 150 		return True | 
|  | 151 | 
|  | 152 	def _alterTranscript(self, transcript, type): | 
|  | 153 		if type == REFERENCE: | 
|  | 154 			if self.distance != None: | 
|  | 155 				transcript.extendExons(self.distance) | 
|  | 156 		return transcript | 
|  | 157 | 
|  | 158 	def _compareTranscript(self, refTranscript): | 
|  | 159 		refChromosome = refTranscript.getChromosome() | 
|  | 160 		if refChromosome not in self.bins: | 
|  | 161 			return [] | 
|  | 162 		refStart = refTranscript.getStart() | 
|  | 163 		refEnd   = refTranscript.getEnd() | 
|  | 164 		bins	 = getOverlappingBins(refStart, refEnd) | 
|  | 165 		for binRange in bins: | 
|  | 166 			for bin in range(binRange[0], binRange[1]+1): | 
|  | 167 				if bin not in self.bins[refChromosome]: | 
|  | 168 					continue | 
|  | 169 				for queryTranscript in self.bins[refChromosome][bin]: | 
|  | 170 					if self._compareTwoTranscripts(queryTranscript, refTranscript): | 
|  | 171 						if queryTranscript not in self.overlaps: | 
|  | 172 							self.overlaps[queryTranscript] = {} | 
|  | 173 						nbElements = int(float(refTranscript.getTagValue("nbElements"))) if "nbElements" in refTranscript.getTagNames() else 1 | 
|  | 174 						self.overlaps[queryTranscript][refTranscript.getName()] = int(float(refTranscript.getTagValue("nbElements"))) if "nbElements" in refTranscript.getTagNames() else 1 | 
|  | 175 						self.nbOverlaps += nbElements | 
|  | 176 | 
|  | 177 	def _updateTranscript(self, queryTranscript): | 
|  | 178 		overlaps = self.overlaps[queryTranscript] | 
|  | 179 		queryTranscript.setTagValue("nbOverlaps", sum(overlaps.values())) | 
|  | 180 		if overlaps: | 
|  | 181 			queryTranscript.setTagValue("overlapsWith", "--".join(overlaps.keys())[:100]) | 
|  | 182 		return queryTranscript | 
|  | 183 | 
|  | 184 	def compare(self): | 
|  | 185 		progress = UnlimitedProgress(10000, "Comparing references", self.verbosity) | 
|  | 186 		for refTranscript in self.refParser.getIterator(): | 
|  | 187 			if refTranscript.__class__.__name__ == "Mapping": | 
|  | 188 				refTranscript = refTranscript.getTranscript() | 
|  | 189 			refTranscript = self._alterTranscript(refTranscript, REFERENCE) | 
|  | 190 			self._compareTranscript(refTranscript) | 
|  | 191 			self.nbRefs += 1 | 
|  | 192 			progress.inc() | 
|  | 193 		progress.done() | 
|  | 194 | 
|  | 195 	def printResults(self): | 
|  | 196 		for transcript in self.overlaps: | 
|  | 197 			if not self.invert or not self.overlaps[transcript]: | 
|  | 198 				if not self.invert: | 
|  | 199 					transcript = self._updateTranscript(transcript) | 
|  | 200 				self.writer.addTranscript(transcript) | 
|  | 201 				self.nbWritten += 1 | 
|  | 202 		self.writer.close() | 
|  | 203 | 
|  | 204 	def displayResults(self): | 
|  | 205 		if self.verbosity: | 
|  | 206 			print "# queries:  %d" % (self.nbQueries) | 
|  | 207 			print "# refs:     %d" % (self.nbRefs) | 
|  | 208 			print "# written:  %d (%d overlaps)" % (self.nbWritten, self.nbOverlaps) | 
|  | 209 | 
|  | 210 	def run(self): | 
|  | 211 		self.loadQuery() | 
|  | 212 		self.compare() | 
|  | 213 		self.printResults() | 
|  | 214 		self.displayResults() | 
|  | 215 | 
|  | 216 if __name__ == "__main__": | 
|  | 217 | 
|  | 218 	description = "Compare Overlapping Small Query v1.0.1: Provide the queries that overlap with a reference, when the query is small. [Category: Data Comparison]" | 
|  | 219 | 
|  | 220 	parser = OptionParser(description = description) | 
|  | 221 	parser.add_option("-i", "--input1",	        dest="inputFileName1", action="store",			           type="string", help="query input file [compulsory] [format: file in transcript format given by -f]") | 
|  | 222 	parser.add_option("-f", "--format1",        dest="format1",		  action="store",			           type="string", help="format of previous file [compulsory] [format: transcript file format]") | 
|  | 223 	parser.add_option("-j", "--input2",	        dest="inputFileName2", action="store",			           type="string", help="reference input file [compulsory] [format: file in transcript format given by -g]") | 
|  | 224 	parser.add_option("-g", "--format2",        dest="format2",		  action="store",			           type="string", help="format of previous file [compulsory] [format: transcript file format]") | 
|  | 225 	parser.add_option("-o", "--output",	        dest="outputFileName", action="store",			           type="string", help="output file [format: output file in GFF3 format]") | 
|  | 226 	parser.add_option("-O", "--notOverlapping", dest="notOverlapping", action="store_true", default=False,				 help="also output not overlapping data [format: bool] [default: false]") | 
|  | 227 	parser.add_option("-d", "--distance",		dest="distance",	   action="store",	    default=0,	   type="int",	 help="accept some distance between query and reference [format: int]") | 
|  | 228 	parser.add_option("-c", "--collinear",		dest="collinear",	   action="store_true", default=False,			 	 help="provide collinear features [format: bool] [default: false]") | 
|  | 229 	parser.add_option("-a", "--antisense",		dest="antisense",	   action="store_true", default=False,			 	 help="provide antisense features [format: bool] [default: false]") | 
|  | 230 	parser.add_option("-p", "--pcOverlapQuery",	dest="pcOverlapQuery", action="store",      default=False, type="int",	 help="min. % overlap of the query [format: bool] [default: false]") | 
|  | 231 	parser.add_option("-P", "--pcOverlapRef",	dest="pcOverlapRef",   action="store",      default=False, type="int",   help="min. % overlap of the reference [format: bool] [default: false]") | 
| 55 | 232 	parser.add_option("-m", "--minOverlap",  	dest="minOverlap",     action="store",      default=False, type="int",   help="min. # overlap between query and reference [format: bool] [default: false]") | 
| 36 | 233 	parser.add_option("-x", "--exclude",		dest="exclude",		   action="store_true", default=False,			 	 help="invert the match [format: bool] [default: false]") | 
|  | 234 	parser.add_option("-v", "--verbosity",      dest="verbosity",	   action="store",      default=1,     type="int",	 help="trace level [format: int]") | 
|  | 235 	(options, args) = parser.parse_args() | 
|  | 236 | 
|  | 237 	cosq = CompareOverlappingSmallQuery(options.verbosity) | 
|  | 238 	cosq.setQueryFile(options.inputFileName1, options.format1) | 
|  | 239 	cosq.setReferenceFile(options.inputFileName2, options.format2) | 
|  | 240 	cosq.setOutputFile(options.outputFileName) | 
|  | 241 	cosq.includeNotOverlapping(options.notOverlapping) | 
|  | 242 	cosq.setDistance(options.distance) | 
|  | 243 	cosq.setCollinear(options.collinear) | 
|  | 244 	cosq.setAntisense(options.antisense) | 
|  | 245 	cosq.setMinPercentOverlap(options.pcOverlapQuery, options.pcOverlapRef) | 
| 55 | 246 	cosq.setMinOverlap(options.minOverlap) | 
| 36 | 247 	cosq.setInvert(options.exclude) | 
|  | 248 	cosq.run() |