nested-lists

I'm a biological engineering PhD student here trying to self-learn Python programming for use in automating a part of my research, but I've ran into a problem with processing sub-lists within a bigger list that I can't seem to solve. Basically, the goal of what I'm trying to do is write a small script that will process a CSV file containing a list of plasmid sequences that I'm building using various DNA assembly methods, and then spit out the primer sequences that I need to order in order to build the plasmid. Here's the scenario that I'm dealing with: When I want to build a plasmid, I have to

I am a newbie in python, I have two lists: l1 = ['a','b','c','d'] l2 = ['new'] i want to get new list like this l3 = [('a','new'),('b','new'),('c','new'),('d','new')] What is the best way to combine the two lists? >>> from itertools import product >>> l1 = ['a','b','c','d'] >>> l2 = ['new'] >>> list(product(l1,l2)) [('a', 'new'), ('b', 'new'), ('c', 'new'), ('d', 'new')] If l2 always just has the one element there is no need to overcomplicate things l3 = [(x, l2[0]) for x in l1] See the itertools docs . In particular, use product for a Cartesian product: from itertools import product: l1 = ['a

How to from this list: list = [ [], ['', 'subitem'], [[]], 'item', [ 'item', 'item', [''], [] ], [] ] I can get this: list = [ ['subitem'], 'item', [ 'item', 'item' ] ] How do I remove recursively all empty nested lists, zero-strings, and lists with nested zero-strings? A one-liner: def remove_empty(l): return tuple(filter(lambda x:not isinstance(x, (str, list, tuple)) or x, (remove_empty(x) if isinstance(x, (tuple, list)) else x for x in l))) realli Recursion： def remove_lst(lst): if not isinstance(lst, list): return lst else: return [x for x in map(remove_lst, lst) if (x != [] and x != '')]

Say I have a list x = [1, 2, 3, 4] Is there a recursive method where i can go through the list to find the value? I want to ultimately be able to compare a returned value in the list, (or nested list) to an arbitrary number to see it it matches. I can think a way to do this using a for loop, but i have trouble imagining a recursive method to do the same thing. I know that I can't set a counter to keep track of my position in the list because calling the function recursively would just reset the counter every time. I was thinking I could set my base case of the function as a comparison between

I'm trying to add all the elements of two unequal nested lists in parallel and append the result back to another new list, i've written a little hacky code that could add them but there's a lot of things wrong with the code, first i tried to make the pairs equal by appending 0's to the end of the list but the code still runs into the problems since the length of the first pair is 3 and the length of the second pair is 4, i also tried using map but i couldn't add an integer and a NoneType, import pdb import itertools x = [[2,3,3], [5,0,3]] y = [[0,3], [2,3,3,3]] for idx, (a, b) in enumerate