代写python Bioinformatics Coursework 编程、代写python 作业、代做python 程序代做Processing|代写Pyt

omputational Thinking 2018/19Bioinformatics CourseworkRob PowellHand in by 2pm on 3rd May 2019 via DUO.Coursework DescriptionThis coursework consists of three parts. The first is to develop a Python program for aligning two DNAsequences, the second is to draw by hand a phylogenetic tree from an inter-species distance matrix, and thethird is to develop a Python program for drawing phylogenetic tress from inter-species distance matrices. Youshould submit your two pieces of Python code and a single PDF file (showing your phylogenetic tree andworkings) via DUO.Objective One: Python Programming to align two DNA sequencesDevelop a Python program that uses Dynamic Programming (as described in the lectures) to compute theoptimal alignment of two sequences. It should meet the following conditions:� The algorithm should read in two sequences from text files (the sequences may be of different lengths).� Initialise the scoring matrix and the backtracking matrix.� Score each alignment using the following scores:– +4 for a matching pair of ’A’ bases,– +3 for a matching pair of ’C’ bases,– +2 for a matching pair of ’G’ bases,– +1 for a matching pair of ’T’ bases,– -3 for a mismatching pair of bases,– -2 for a gap.� Use the backtracking matrix to determine an optimal alignment.� The program should print out the following:– The optimal alignment and its score.– Execution time.As an example consider the following alignment of two sequences of length 4. It would be given score of -1.A A T G –A C – G T+4 -3 -2 +2 -2Note: A template is provided for you that covers the first and last bullet point, and you may use a package suchas numpy for matrices if you find it helpful. You should test your program with the test sequences providedon DUO. These will allow you to check your program is working as expected. Your program should be ableto handle two input sequences of different length e.g aligning a sequence of length 8 with a sequence of length10, as well as two sequences of the same length.1Objective Two: Constructing a Phylogenetic Tree by handUsing the following matrix of inter-species distances, construct a phylogenetic tree using the UPGMA algorithm(as described in the lectures). You should submit a PDF file showing all of your working, and the finalphylogenetic tree that links the species a,b,c,d,e, and f. This tree should include edge weights, but I do notexpect it to be drawn to scale.a b c d e fa 0 15 24 29 25 37b 15 0 32 31 23 43c 24 32 0 30 43 49d 29 31 30 0 45 57e 25 23 43 45 0 55f 37 43 49 57 55 0Objective Three: Python Programming to calculate and draw phylogenetic treesDevelop a Python program that uses the WPGMA algorithm (as described in the lectures) to draw a phylogenetictree from an input matrix of inter-species distances. It should meet the following conditions:� Your code should have a function called WPGMA which takes as its input the name of a text file.� The algorithm should read in an inter-species distance matrix from this text file, and print this matrix tothe screen.� Follow the WPGMA algorithm, and print out to the screen every reduced distance matrix.� After fully reducing the matrix, the code should draw the phylogentic tree obtained to a file. This treedoes not need to contain edge weights. To achieve this you should use the packages networkx andmatplotlib.� Finally the program should print out the execution time to the screen.Note: You may use a package such as numpy for matrices if you find it helpful. There are two test matricesstored in text files available on DUO. These will allow you to check your program is working as expected. Yourprogram should be able to handle an input matrix of any size.Marking CriteriaThe breakdown of marks are as follows:� Dynamic Programming Python code - 35%� Constructing a Phylogenetic Tree by hand - 30%� Constructing a Phylogenetic Tree using Python code - 35%5 of the 35 marks for each programming aspect will be given for how efficiently your code executes. Thesewill be awarded based on a sliding scale against the execution time of a Python program of my own. The codemust work on all test cases to achieve these marks.本团队核心人员组成主要包括BAT一线工程师，精通德英语！我们主要业务范围是代做编程大作业、课程设计等等。我们的方向领域：window编程 数值算法 AI人工智能 金融统计 计量分析 大数据 网络编程 WEB编程 通讯编程 游戏编程多媒体linux 外挂编程 程序API图像处理 嵌入式/单片机 数据库编程 控制台 进程与线程 网络安全 汇编语言 硬件编程 软件设计 工程标准规等。其中代写编程、代写程序、代写留学生程序作业语言或工具包括但不限于以下范围:C/C++/C#代写Java代写IT代写Python代写辅导编程作业Matlab代写Haskell代写Processing代写Linux环境搭建Rust代写Data Structure Assginment 数据结构代写MIPS代写Machine Learning 作业 代写Oracle/SQL/PostgreSQL/Pig 数据库代写/代做/辅导Web开发、网站开发、网站作业ASP.NET网站开发Finance Insurace Statistics统计、回归、迭代Prolog代写Computer Computational method代做因为专业，所以值得信赖。如有需要，请加QQ：99515681 或邮箱：[email protected] 微信：codehelp