SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 304 Weeks Ago, 6 Days Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 19 Nov 2017 My Price 10.00

Data Structures and Algorithms Homework 2 1.

pls help to solve following data structure algorithms

Data Structures and Algorithms Homework 2 1. What is the Manhattan Tourist Problem, and how does it apply to the comparison of biological sequences? 2. Hamming vs Edit Distance Methods: a. Compute the Hamming distance for these two sequences: AATCGACTTAGCA and AGTCGACATACCA b. Compute the Edit distance for these two sequences: the sequences AATCGACTTAGCA and AGTCGATACCA c. Which of the two method (Hamming vs Edit) is more appropriate for biological sequence data, and why? 3. Consider the sequences S1 = TACGGGTAT and S2 = GGACGTACG. Assume that the match score is 1, mismatch score is -1, and gap penalty is d = -2. You must show the scoring matrix for full credit! a. Find an optimal global alignment b. Final an optimal local alignment 4. Given the following alignments of three sequences, what is the sum-of-pairs score? Assume that the scoring system: match score = 1, mismatch score = -2, gap score = -4. Show all of your work for full credit! ACCTCTGTC AC-TGTAAC ACCTGT-AC

Attachments:

Answers

SophiaPretty
(5)
Status NEW Posted 19 Nov 2017 01:11 PM My Price 10.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)