1using suffix trees give an algorithm to nd a longest

Assignment Help Theory of Computation
Reference no: EM13346828

1.

Using suffix trees, give an algorithm to nd 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 satis es.

(i) occurs exactly once in s (uniqueness),
(ii) all proper pre xes 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 identi cation. Given a set of k DNA sequences, S = {s1, s2, . . . , sk}, give an optimal algorithm to identify all sequences that are completely contained in (i.e., substrings of) at least one other sequence in S.

4.

Let S = {s1, s2, . . . , sk} denote a set of k genomes. The problem of ngerprinting 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 ngerprint of si.

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

5.
A string s is said to be periodic with a period α , if s is αk for some k ≥2. A DNA sequence s is called a tandem repeat if it is periodic. Given a DNA sequence s, determine if it is periodic, and if so, the values for and k. Note that there could be more than one period for a periodic string. In such a case, you need to report the shortest period.

6.

A non-empty string is called a repeat pre x of a string s if is a pre x of s. Give a linear time algorithm to nd the longest repeat pre x of s.

7.

Given strings s1 and s2 of lengths m and n respectively, a minimum cover of s1 by s2 is a decomposition s1 = w1w2 . . .wk, where each wi is a non-empty substring of s2 and k is minimized. Eg., given s1 = accgtatct and s2 = cgtactcatc, there are several covers of s1 by s2 possible, two of which are. (i) cover1. s1 = w1w2w3w4 (where w1 = ac, w2 = cgt, w3 = atc, w4 = t) , and (ii) cover2. s1 =  w1w2w3w4w5 (where w1 = ac, w2 = c, w3 = gt, w4 = atc, w5 = t). However, only cover1 is a minimal cover. Give an algorithm to compute a minimum cover (if one exists) in O(m + n) time and space. If a minimum cover does not exist your algorithm should state so and terminate within the same time and space bounds. Give a brief justi cation of why you think your algorithm is correct | meaning, how it guarantees nding the minimial cover.

Reference no: EM13346828

Questions Cloud

Prepare the design and evaluation of a new chemical : prepare the design and evaluation of a new chemical manufacturing process.1 acetylation reactor2 separation of
Question 1 - explain the key characteristics of the chinese : question 1 - explain the key characteristics of the chinese economy during the mao era- the socio-economic
Q1 15 kg of oxygen n2 and 015 kg of helium he2 are : q1. 1.5 kg of oxygen n2 and 0.15 kg of helium he2 are separated by a partition in a vessel.nbsp the nitrogen is at 5
Select a company for analysis this company should be quoted : select a company for analysis. this company should be quoted on one of the principal international exchanges.prepare a
1using suffix trees give an algorithm to nd a longest : 1.using suffix trees give an algorithm to nd a longest common substring shared among three input strings. s1 of length
Venture capital amp private equityit is argued that vc and : venture capital amp private equityit is argued that vc and pe houses achieve superior returns through ruthlessly
1 let a 1 2 3 na how many relations on a are both : 1. let a 1 2 3 n.a how many relations on a are both symmetric and antisymmetric?b if r is a relation on a that is
Write a paper on organizational behavior classquestion : write a paper on organizational behavior class.question related to paperwhat role did diversity play on this
1 what do you meant by entrepreneurshipnbsp what are some : 1 what do you meant by entrepreneurship?nbsp what are some basic characteristics of entrepreneurs? 2 what is

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