PyOPA - optimal pairwise sequence alignments
Project description
This python package provides a fast implementation to compute
optimal pairwise alignments of molecular sequences
ML distance estimates of pairwise alignments.
The implementation uses Farrar’s algorithm <http://bioinformatics.oxfordjournals.org/content/23/2/156.abstract>_ to compute the optimal pairwise alignment using SSE vectorization operations. This package implements the Smith-Waterman and Needleman-Wunsch algorithm to compute the local and global sequence alignments.
Example
import pyopa
log_pam1_env = pyopa.read_env_json(os.path.join(pyopa.matrix_dir(), 'logPAM1.json'))
s1 = pyopa.Sequence('GCANLVSRLENNSRLLNRDLIAVKINADVYKDPNAGALRL')
s2 = pyopa.Sequence('GCANPSTLETNSQLVNRELIAVKINPRVYKGPNLGAFRL')
# super fast check whether the alignment reaches a given min-score
min_score = 100
pam250_env = pyopa.generate_env(log_pam1_env, 250, min_score)
pyopa.align_short(s1, s2, pam250_env)
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
pyopa-0.7.0.tar.gz
(8.0 MB
view hashes)
Built Distributions
Close
Hashes for pyopa-0.7.0-cp35-cp35m-macosx_10_11_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 98ad7e13a94e3e29f5a987c6841dd03b174fc074bee0ffa4138b9b9a40a2dbee |
|
MD5 | 2e6f64bdaeba85bdd22aae0785ba1a61 |
|
BLAKE2b-256 | 8e8299ed604c7988c890dd063933489f88e82ec362109b511ba49b665e5fe2b7 |
Close
Hashes for pyopa-0.7.0-cp27-cp27mu-macosx_10_11_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 76092006206e4b3c2d72fb8f9666e23340a0437b542f0a90e3a81293efb9793b |
|
MD5 | bdf38e97c484a2ae557612ff48479587 |
|
BLAKE2b-256 | f5162d846f0b0d85249cc6f6c1029e7195588366b8120bce0f8cf57eedec319d |