On Tue, Jul 13, 2010 at 8:00 PM, Vikram <kp...@rediffmail.com> wrote:
> Suppose you have two nested lists, X and Y. > A sample element of X is: > ['NM_032291', '67000041', '67000051', 'chr1', '+'] > > Another sample element of X is: > ['NM_001097', '51183080', '51183635', 'chr22', '+'] > > > A sample element of Y is: > ['chr1', '67000046'] > > Another sample element of Y is: > ['chrY', '59033300'] > > The objective is to identify whether the second element of an element of Y > (e.g. 67000046) lies between the the second and third elements of an element > of X (e.g. 67000041 and 67000051). > > Eventually, one should end up with a modified version of Y, let us say > modY, which is a filtered version of Y in which the second element of an > element of modY is contained within the second and third elements of an > element of X. > > Any suggestions on how i should be going about implementing this? > >>> modY = [y for y in Y for x in X if x[1] < y[1] < x[2]] > > Thanking you, > Vikram > _______________________________________________ > BangPypers mailing list > BangPypers@python.org > http://mail.python.org/mailman/listinfo/bangpypers > _______________________________________________ BangPypers mailing list BangPypers@python.org http://mail.python.org/mailman/listinfo/bangpypers
