Find a longest common substring shared among three input

Assignment Help Theory of Computation
Reference no: EM131178790

1. Using suffx trees, give an algorithm to find a longest common substring shared among three input strings: s1 of length n1, s2 of length n2 and s3 of length n3.

2. A non-empty string α is called a minimal unique substring of s if and only if it satisfies:

(i) α occurs exactly once in s (uniqueness),

(ii) all proper prefixes of α occur at least twice in s (mimimality), and

(iii) α≥l for some constant l.

Give an optimal algorithm to enumerate all minimal unique substrings of s.

3. Redundant sequence identification: Given a set of k DNA sequences, S = {s1,s2,.......,sk}, give an optimal algorithm to identify allsequences that are completely contained in (i.e., substrings of) at least one other sequence in S.

4. Collaborative

Let S = {s1,s2,...........,sk} denote a set of k genomes. The problem of fingerprinting is the task of identifying a shortest possible substring α i from each string si such that  αi is unique to si -- i.e., no other genome in the set S has α i. Such an α i will be called a fingerprint of si.

(Note that it is OK for i to be present more than once within si.)

Give an algorithm to enumerate a fingerprint for each input genome, if one exists. Assume that no two input genomes are identical.


Attachment:- Theory_Of_Computation (1).PDF

Reference no: EM131178790

Questions Cloud

Explain how the human resource department aligns : Identify at least three (3) factors that need to be considered in the formulation of this department. Include at least four (4) different disciplines that are in the structure of a Human Resources Department and a brief description of each.
Marketing communications planning : Managing and coordinating the complete communications practice calls for thorough marketing communications planning. It is important to identify the added value of an inclusive plan that assesses the tactical roles of an assortment of communicatio..
Complete the excel assignment based on medical payment : Complete the excel assignment based on medical payment.- Follow the directions "Patient data for day sheets" to complete the "DaySheets" document that is also attached.
Explain the system that you will create to track each goal : Explain the system that you will create to track each goal. Demonstrate an understanding of your obligation to complete this goal within the given time frame.
Find a longest common substring shared among three input : Using suffx trees, give an algorithm to find a longest common substring shared among three input strings: s1 of length n1, s2 of length n2and s3 of length n3.
How branding has increased in the last few decades : Assess how branding has increased in the last few decades. Think of a brand; analyze how the organization developed its brand equity. Assess the influence of branding on an organization's IMC.
Use of equity financing over debt financing accurate : Christopher argues that the company should increase its use of equity financing because debt costs 25% while equity only costs 20% and thus, equity is cheaper. Is Christopher's analysis of the cost of equity, debt, and decision to increase the use..
What is known as the newton-pepys problem : Discuss the history and solution of what is known as the Newton-Pepys problem, which asks which is most likely: rolling at least one six when six dice are rolled, rolling at least two sixes when 12 dice are rolled, or rolling at least three sixes ..
Show the gains or losses with the current plan : 1. Show the gains or losses with the current plan.  Explain how those gains were calculated (because that is where I am at a loss). 2. Show the gains or losses with the proposed plan.  Explain how those are calculated.

Reviews

Write a Review

Theory of Computation Questions & Answers

  Finite-state machine design

Create a finite-state machine design to turn your FPGA development board into a simple programmable music box.

  Redundant sequence identi cation

Redundant sequence identi cation

  Compute a shortest superstring

Dynamic programming algorithm to compute a shortest superstring.

  Propositional and predicate logic

Write down a structural induction principle for the PlayTree free type

  Design a syntactic analyzer

Design a syntactic analyzer for the language specified by the grammar

  Design unambiguous grammar to parse expressions

Write a program would read two numbers and then print all numbers between the first and the second, inclusive. Design unambiguous grammar to parse expressions

  Consider a logic function with three outputs

Consider a logic function with three outputs,  A ,  B , and  C , and three inputs,  D ,  E , and  F . The function is defined as follows:  A  is true if at least one input is true,  B  is true

  Considering a single programmed operating system

Considering a single programmed operating system, what is the minimal total time required to complete executions of the two processes? You should explain your answer with a diagram.

  How to construct an nfa

Give a construction that assumes you are given a DFA for L and show how to construct an NFA (with or without ε-moves) to recognize sort(L).

  Equivalence classes to construct minimal dfa for language

How many equivalence classes does this relation have and what are they? Use these equivalence classes to construct the minimal DFA for the language.

  Impact of moore-s law on data center costs

Discuss the impact of Moore's law on data center costs on such things as servers and communications equipment. List at least 3 steps or recommendations your data center can take to offset some or all of the effect of Moore's law.

  Problem encountered in statements in predicate logic

How the problem would be encountered in attempting to represent the following statements in Predicate logic. it should be possible to: John only likes to see French movies.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd