Mercurial > repos > richard-burhans > segalign
view diagonal_partition.py @ 9:08e987868f0f draft
planemo upload for repository https://github.com/richard-burhans/galaxytools/tree/main/tools/segalign commit 062a761a340e095ea7ef7ed7cd1d3d55b1fdc5c4
author | richard-burhans |
---|---|
date | Wed, 10 Jul 2024 17:06:45 +0000 |
parents | |
children | 25fa179d9d0a |
line wrap: on
line source
#!/usr/bin/env python """ Diagonal partitioning for segment files output by SegAlign. Usage: diagonal_partition.py <max-segments> <lastz-command> set <max-segments> = 0 to skip partitioning, -1 to infer best parameter """ import os import sys import typing def chunks(lst: tuple[str, ...], n: int) -> typing.Iterator[tuple[str, ...]]: """Yield successive n-sized chunks from list.""" for i in range(0, len(lst), n): yield lst[i:i + n] if __name__ == "__main__": DELETE_AFTER_CHUNKING = True MIN_CHUNK_SIZE = 5000 # don't partition segment files with line count below this value # input_params = "10000 sad sadsa sad --segments=tmp21.block0.r0.minus.segments dsa sa --strand=plus --output=out.maf sadads 2> logging.err" # sys.argv = [sys.argv[0]] + input_params.split(' ') chunk_size = int(sys.argv[1]) # first parameter contains chunk size params = sys.argv[2:] # don't do anything if 0 chunk size if chunk_size == 0: print(" ".join(params), flush=True) exit(0) # Parsing command output from SegAlign segment_key = "--segments=" segment_index = None input_file = None for index, value in enumerate(params): if value[:len(segment_key)] == segment_key: segment_index = index input_file = value[len(segment_key):] break if segment_index is None: sys.exit(f"Error: could not get segment key {segment_key} from parameters {params}") if input_file is None: sys.exit(f"Error: could not get segment file from parameters {params}") if not os.path.isfile(input_file): sys.exit(f"Error: File {input_file} does not exist") line_size = None # each char in 1 byte file_size = os.path.getsize(input_file) with open(input_file, "r") as f: line_size = len(f.readline()) # add 1 for newline estimated_lines = file_size // line_size # check if chunk size should be estimated if chunk_size < 0: # optimization, do not need to get each file size in this case if estimated_lines < MIN_CHUNK_SIZE: print(" ".join(params), flush=True) exit(0) from collections import defaultdict from statistics import quantiles # get size of each segment assuming DELETE_AFTER_CHUNKING == True # takes into account already split segments files = [i for i in os.listdir(".") if i.endswith(".segments")] # find . -maxdepth 1 -name "*.segments" -print0 | du -ba --files0-from=- # if not enough segment files for estimation, continue if len(files) <= 2: print(" ".join(params), flush=True) exit(0) fdict: typing.DefaultDict[str, int] = defaultdict(int) for filename in files: size = os.path.getsize(filename) f_ = filename.split(".split", 1)[0] fdict[f_] += size chunk_size = int(quantiles(fdict.values())[-1] // line_size) if file_size // line_size <= chunk_size: # no need to sort if number of lines <= chunk_size print(" ".join(params), flush=True) exit(0) # Find rest of relevant parameters output_key = "--output=" output_index = None output_alignment_file = None output_alignment_file_base = None output_format = None strand_key = "--strand=" strand_index = None for index, value in enumerate(params): if value[:len(output_key)] == output_key: output_index = index output_alignment_file = value[len(output_key):] output_alignment_file_base, output_format = output_alignment_file.rsplit(".", 1) if value[:len(strand_key)] == strand_key: strand_index = index if output_index is None: sys.exit(f"Error: could not get output key {output_key} from parameters {params}") if output_alignment_file_base is None: sys.exit(f"Error: could not get output alignment file base from parameters {params}") if output_format is None: sys.exit(f"Error: could not get output format from parameters {params}") if strand_index is None: sys.exit(f"Error: could not get strand key {strand_key} from parameters {params}") err_index = -1 # error file is at very end err_name_base = params[-1].split(".err", 1)[0] data: dict[tuple[str, str], list[tuple[int, int, str]]] = {} # dict of list of tuple (x, y, str) direction = None if "plus" in params[strand_index]: direction = "f" elif "minus" in params[strand_index]: direction = "r" else: sys.exit(f"Error: could not figure out direction from strand value {params[strand_index]}") for line in open(input_file, "r"): if line == "": continue seq1_name, seq1_start, seq1_end, seq2_name, seq2_start, seq2_end, _dir, score = line.split() # data.append((int(seq1_start), int(seq2_start), line)) half_dist = int((int(seq1_end) - int(seq1_start)) // 2) assert int(seq1_end) > int(seq1_start) assert int(seq2_end) > int(seq2_start) seq1_mid = int(seq1_start) + half_dist seq2_mid = int(seq2_start) + half_dist data.setdefault((seq1_name, seq2_name), []).append((seq1_mid, seq2_mid, line)) # If there are chromosome pairs with segment count <= chunk_size # then no need to sort and split these pairs into separate files. # It is better to keep these pairs in a single segment file. skip_pairs = [] # pairs that have count <= chunk_size. these will not be sorted # save query key order # for lastz segment files: 'Query sequence names must appear in the same # order as they do in the query file' query_key_order = list(dict.fromkeys([i[1] for i in data.keys()])) # NOTE: assuming data.keys() preserves order of keys. Requires Python 3.7+ if len(data.keys()) > 1: for pair in data.keys(): if len(data[pair]) <= chunk_size: skip_pairs.append(pair) # sorting for forward segments if direction == "r": for pair in data.keys(): if pair not in skip_pairs: data[pair] = sorted(data[pair], key=lambda coord: (coord[1] - coord[0], coord[0])) # sorting for reverse segments elif direction == "f": for pair in data.keys(): if pair not in skip_pairs: data[pair] = sorted(data[pair], key=lambda coord: (coord[1] + coord[0], coord[0])) else: sys.exit(f"INVALID DIRECTION VALUE: {direction}") # Writing file in chunks ctr = 0 for pair in data.keys() - skip_pairs: # [i for i in data_keys if i not in set(skip_pairs)]: for chunk in chunks(list(zip(*data[pair]))[2], chunk_size): ctr += 1 name_addition = f".split{ctr}" fname = input_file.split(".segments", 1)[0] + name_addition + ".segments" assert len(chunk) != 0 with open(fname, "w") as f: f.writelines(chunk) # update segment file in command params[segment_index] = segment_key + fname # update output file in command params[output_index] = output_key + output_alignment_file_base + name_addition + "." + output_format # update error file in command params[-1] = err_name_base + name_addition + ".err" print(" ".join(params), flush=True) # writing unsorted skipped pairs if len(skip_pairs) > 0: skip_pairs_with_len = sorted([(len(data[p]), p) for p in skip_pairs]) # list of tuples of (pair length, pair) # NOTE: This can violate lastz query key order requirement query_key_order_table = {item: idx for idx, item in enumerate(query_key_order)} # used for sorting aggregated_skip_pairs: list[list[tuple[str, str]]] = [] # list of list of pair names current_count = 0 aggregated_skip_pairs.append([]) for count, pair in skip_pairs_with_len: if current_count + count <= chunk_size: current_count += count aggregated_skip_pairs[-1].append(pair) else: aggregated_skip_pairs.append([]) current_count = count aggregated_skip_pairs[-1].append(pair) for aggregate in aggregated_skip_pairs: ctr += 1 name_addition = f".split{ctr}" fname = input_file.split(".segments", 1)[0] + name_addition + ".segments" with open(fname, "w") as f: # fix possible lastz query key order violations for pair in sorted(aggregate, key=lambda p: query_key_order_table[p[1]]): # p[1] is query key chunk = list(zip(*data[pair]))[2] f.writelines(chunk) # update segment file in command params[segment_index] = segment_key + fname # update output file in command params[output_index] = output_key + output_alignment_file_base + name_addition + "." + output_format # update error file in command params[-1] = err_name_base + name_addition + ".err" print(" ".join(params), flush=True) if DELETE_AFTER_CHUNKING: os.remove(input_file)