I'm looking some implementation in Python for finding out sets of sequences of equal length and which share a common sub sequence and a common overhang when aligned (without gaps) from a large collection of sequences as follows.
Their alphabetically sorted sequence will be the same , but that will include just any permuted sequence as well, which I don't want. Can the Python 'difflib' library be of any help? Thanks
Their alphabetically sorted sequence will be the same , but that will include just any permuted sequence as well, which I don't want. Can the Python 'difflib' library be of any help? Thanks
Code:
XYZASDFL ::::: ASDFLXYZ ::::::: SDFLXYZA