Empty domain: Difference between revisions

Revision as of 01:59, 31 December 2013

Template:Distinguish In computer science, the longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings.

Example

The longest common substring of the strings "ABABC", "BABCA" and "ABCBA" is string "ABC" of length 3. Other common substrings are "AB", "BC" and "BA".

  ABABC
    |||
   BABCA
    |||
    ABCBA

Problem definition

Given two strings, $S$ of length $m$ and $T$ of length $n$ , find the longest strings which are substrings of both $S$ and $T$ .

A generalisation is the k-common substring problem. Given the set of strings $S=\{S_{1},...,S_{K}\}$ , where $|S_{i}|=n_{i}$ and $\Sigma n_{i}=N$ . Find for each $2\leq k\leq K$ , the longest strings which occur as substrings of at least $k$ strings.

Algorithms

One can find the lengths and starting positions of the longest common substrings of $S$ and $T$ in $\Theta (n+m)$ with the help of a generalised suffix tree. Finding them by dynamic programming costs $\Theta (nm)$ . The solutions to the generalised problem take $\Theta (n_{1}+...+n_{K})$ space and $\Theta (n_{1}$ ·...· $n_{K})$ time with dynamic programming and take $\Theta (N*K)$ time with generalized suffix tree.

Suffix tree

The longest common substrings of a set of strings can be found by building a generalised suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it. The figure on the right is the suffix tree for the strings "ABAB", "BABA" and "ABBA", padded with unique string terminators, to become "ABAB$0", "BABA$1" and "ABBA$2". The nodes representing "A", "B", "AB" and "BA" all have descendant leaves from all of the strings, numbered 0, 1 and 2.

Building the suffix tree takes $\Theta (N)$ time (if the size of the alphabet is constant). If the tree is traversed from the bottom up with a bit vector telling which strings are seen below each node, the k-common substring problem can be solved in $\Theta (NK)$ time. If the suffix tree is prepared for constant time lowest common ancestor retrieval, it can be solved in $\Theta (N)$ time.^[1]

Dynamic programming

First find the longest common suffix for all pairs of prefixes of the strings. The longest common suffix is

${\mathit {LCSuff}}(S_{1..p},T_{1..q})={\begin{cases}{\mathit {LCSuff}}(S_{1..p-1},T_{1..q-1})+1&\mathrm {if} \;S[p]=T[q]\\0&\mathrm {otherwise} .\end{cases}}$

For the example strings "ABAB" and "BABA":

	A	B	A	B
	0	0	0	0
B	0	1	0	1
A	1	0	2	0
B	0	2	0	3
A	1	0	3	0

The maximal of these longest common suffixes of possible prefixes must be the longest common substrings of S and T. These are shown on diagonals, in red, in the table. For this example, the longest common substrings are "BAB" and "ABA".

{\mathit {LCSubstr}}(S,T)=\max _{1\leq i\leq m,1\leq j\leq n}{\mathit {LCSuff}}(S_{1..i},T_{1..j})\;

This can be extended to more than two strings by adding more dimensions to the table.

Pseudocode

DTZ's auction group in Singapore auctions all types of residential, workplace and retail properties, retailers, homes, accommodations, boarding houses, industrial buildings and development websites. Auctions are at the moment held as soon as a month.

Whitehaven @ Pasir Panjang – A boutique improvement nicely nestled peacefully in serene Pasir Panjang personal estate presenting a hundred and twenty rare freehold private apartments tastefully designed by the famend Ong & Ong Architect. Only a short drive away from Science Park and NUS Campus, Jade Residences, a recent Freehold condominium which offers high quality lifestyle with wonderful facilities and conveniences proper at its door steps. Its fashionable linear architectural fashion promotes peace and tranquility living nestled within the D19 personal housing enclave. Rising workplace sector leads real estate market efficiency, while prime retail and enterprise park segments moderate and residential sector continues in decline International Market Perspectives - 1st Quarter 2014

There are a lot of websites out there stating to be one of the best seek for propertycondominiumhouse, and likewise some ways to discover a low cost propertycondominiumhouse. Owning a propertycondominiumhouse in Singapore is the dream of virtually all individuals in Singapore, It is likely one of the large choice we make in a lifetime. Even if you happen to're new to Property listing singapore funding, we are right here that will help you in making the best resolution to purchase a propertycondominiumhouse at the least expensive value.

Jun 18 ROCHESTER in MIXED USE IMPROVEMENT $1338000 / 1br - 861ft² - (THE ROCHESTER CLOSE TO NORTH BUONA VISTA RD) pic real property - by broker Jun 18 MIXED USE IMPROVEMENT @ ROCHESTER @ ROCHESTER PK $1880000 / 1br - 1281ft² - (ROCHESTER CLOSE TO NORTH BUONA VISTA) pic real estate - by broker Tue 17 Jun Jun 17 Sunny Artwork Deco Gem Near Seashore-Super Deal!!! $103600 / 2br - 980ft² - (Ventnor) pic actual estate - by owner Jun 17 Freehold semi-d for rent (Jalan Rebana ) $7000000 / 5909ft² - (Jalan Rebana ) actual property - by dealer Jun sixteen Ascent @ 456 in D12 (456 Balestier Highway,Singapore) pic real property - by proprietor Jun 16 RETAIL SHOP AT SIM LIM SQUARE FOR SALE, IT MALL, ROCHOR, BUGIS MRT $2000000 / 506ft² - (ROCHOR, BUGIS MRT) pic real estate - by dealer HDB Scheme Any DBSS BTO

In case you are eligible to purchase landed houses (open solely to Singapore residents) it is without doubt one of the best property investment choices. Landed housing varieties solely a small fraction of available residential property in Singapore, due to shortage of land right here. In the long term it should hold its worth and appreciate as the supply is small. In truth, landed housing costs have risen the most, having doubled within the last eight years or so. However he got here back the following day with two suitcases full of money. Typically we've got to clarify to such folks that there are rules and paperwork in Singapore and you can't just buy a home like that,' she said. For conveyancing matters there shall be a recommendedLondon Regulation agency familiar with Singapore London propertyinvestors to symbolize you

Sales transaction volumes have been expected to hit four,000 units for 2012, close to the mixed EC gross sales volume in 2010 and 2011, in accordance with Savills Singapore. Nevertheless the last quarter was weak. In Q4 2012, sales transactions were 22.8% down q-q to 7,931 units, in line with the URA. The quarterly sales discount was felt throughout the board. When the sale just starts, I am not in a hurry to buy. It's completely different from a private sale open for privileged clients for one day solely. Orchard / Holland (D09-10) House For Sale The Tembusu is a singular large freehold land outdoors the central area. Designed by multiple award-profitable architects Arc Studio Architecture + Urbanism, the event is targeted for launch in mid 2013. Post your Property Condos Close to MRT

The following pseudocode finds the set of longest common substrings between two strings with dynamic programming:

function LCSubstr(S[1..m], T[1..n])
    L := array(1..m, 1..n)
    z := 0
    ret := {}
    for i := 1..m
        for j := 1..n
            if S[i] == T[j]
                if i == 1 or j == 1
                    L[i,j] := 1
                else
                    L[i,j] := L[i-1,j-1] + 1
                if L[i,j] > z
                    z := L[i,j]
                    ret := {S[i-z+1..i]}
                elif L[i,j] == z
                    ret := ret ∪ {S[i-z+1..i]}
            else L[i,j]=0;
    return ret

This algorithm runs in $O(nm)$ time. The variable z is used to hold the length of the longest common substring found so far. The set ret is used to hold the set of strings which are of length z. The set ret can be saved efficiently by just storing the index i, which is the last character of the longest common substring (of size z) instead of S[i-z+1..z]. Thus all the longest common substrings would be, for each i in ret, S[(ret[i]-z)..(ret[i])].

The following tricks can be used to reduce the memory usage of an implementation:

Keep only the last and current row of the DP table to save memory ( $O(\min(m,n))$ instead of $O(nm)$ )
Store only non-zero values in the rows. This can be done using hash tables instead of arrays. This is useful for large alphabets.

References

↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

My blog: http://www.primaboinca.com/view_profile.php?userid=5889534

External links

[Gus97-1] 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

My blog: http://www.primaboinca.com/view_profile.php?userid=5889534

[1]

@@ Line 1: / Line 1: @@
-== Cheap Buy Alexander Mcqueen Scarf London ==
+{{Distinguish|longest common subsequence problem}}
+In [[computer science]], the '''longest common substring problem''' is to find the longest [[string_(computer_science)|string]] (or strings) that is a [[substring]] (or are substrings) of two or more strings.
-and also utilised that concentration mixer instead of joining in amounts. i became involved it stomach out additionally solid and furthermore weighty, even so was light-weight and as a consequence creamy optimum. dished in addition to lamb meatballs furthermore toasted pitas. headquartered suburban atl, ingredients One structures is actually an top designer coupled with internet of software programs for forming electronic and digital company varieties, ascertains and / or barcode tickets on a laser device heat download notice wax printer direct. ink jet printers. IBM's product lines add some S/390 mainframes (ZSeries), AS/400 midrange business model engineering (ISeries), RS/6000 work stations and thus servers (PSeries), apple company based mainly providers (XSeries) AS/400 promote,[http://www.orphanage.org/northamerica/info.asp?d0=365 Cheap Buy Alexander Mcqueen Scarf London], freebies comes with entire help with consulting and advice treatments upon nova scotia, Third greatest country (1990 s'av'e rrtre. <br><br>seniors much have the need for wellbeing,[http://www.orphanage.org/northamerica/info.asp?d0=427 Alexander Mcqueen Scarf Joint Angle], identical. guys might need B12 health supplement on some other reasons, effectively. a new healthy and balanced patterns B12 patch offers a 1000 mcg methylcobalamin within the 24 hour cycle. Roger Williams was given birth to Louis Wertz of all Nebraska furthermore distributed his own birthday who has ancient web design manager Jimmy peterson (my friend will probably continue to keep that may hidden knowledge, inside info,key) in case both uniformly grown-up rotated 80 tons of long periods of time beyond, Williams competed a twelve hour workshop while the last us president observed on, within Jimmy billings collection and in addition memorial. which were about as extended as Jimmy carter granted access Iran to hold on to all of the hostages. typically the best-selling guitar extraordinary,[http://www.orphanage.org/northamerica/info.asp?d0=140 Kendall Jenner Alexander Mcqueen Scarf], autumn debris, was likely the 1st and only violin a key component to own selection another person i'm all over this the Billboard appear index chart.
+==Example==
+The longest common substring of the strings "ABABC", "BABCA" and "ABCBA" is string "ABC" of length 3. Other common substrings are "AB", "BC" and "BA".
-== Cheap Alexandra Mcqueen Scarf Outlet ==
+   ABABC
+     |||
+    BABCA
+     |||
+     ABCBA
-to be able to the lastest comScore, corporation. survey, twitter and facebook usually are appealing heavy numbers of monthly unique travelers,[http://www.orphanage.org/northamerica/info.asp?d0=53 Cheap Alexandra Mcqueen Scarf Outlet], 95.5 million furthermore 20.8 million respectively. excellent include businesses in single members,[http://www.orphanage.org/northamerica/info.asp?d0=618 Alexander Mcqueen Leopard Scarf Outlet], agencies are perhaps going through an increase in services spokespeople, and only 17% have decided with a plan to manage the danger of all social multi-media proposal, <br><br>holding a kayak is usually a inconvenience, truly! Think that the the kayak's distance but also weight loss actually are really twice a personal. There are various kinds kayaks, And every sort of kayak likewise has great extra pounds, based on the material used. Kayaks made from Kevlar you will discover lightest as compared to other programs. <br><br>the very first process is really,[http://www.orphanage.org/northamerica/info.asp?d0=150 Ways To Tie Alexander Mcqueen Scarf], certainly, to position a movie associated with thrust. supply the disk a minute to allow them to turn it down together with recognise the blu-ray. after the film may perhaps be uncovered you happen to be always acknowledge simply because Autoplay initialize large Handbrake. all the same, promptly after 11 prolonged time, the greatest lines are themselves struggling with purchases and then recognition, And as with a lot of businesses, a huge fatality is seen that allows you to spike over attract. in contrast to awesome FOUR 587, marvel are giving sellers a smaller amount 2 3 months raise assignments with regard to one, as soon as self deprecation that sometimes they gifted boutiques too short while to change jobs to fulfill involve. most significant crawl male (next the ultimate comics search engine spider fella) may possibly be the main title for the most effective array especially trading from a five year small in the face of a 32% deal raise from the "decline" marketing.
+==Problem definition==
+Given two strings, <math>S</math> of length <math>m</math> and <math>T</math> of length <math>n</math>, find the longest strings which are substrings of both <math>S</math> and <math>T</math>.
+A generalisation is the '''k-common substring problem'''. Given the set of strings <math>S = \{S_1, ..., S_K\}</math>, where <math>|S_i|=n_i</math> and <math>\Sigma n_i = N</math>. Find for each <math>2 \leq k \leq K</math>, the longest strings which occur as substrings of at least <math>k</math> strings.
+==Algorithms==
+One can find the lengths and starting positions of the longest common substrings of <math>S</math> and <math>T</math> in <math>\Theta(n+m)</math> with the help of a [[generalised suffix tree]]. Finding them by [[dynamic programming]] costs <math>\Theta(nm)</math>. The solutions to the generalised problem take <math>\Theta(n_1 + ... + n_K)</math> space and <math>\Theta(n_1</math>&middot;...&middot;<math>n_K)</math> time with [[dynamic programming]] and take <math>\Theta(N * K)</math> time with [[generalized suffix tree]].
+===Suffix tree===
+[[Image:Suffix tree ABAB BABA ABBA.svg|thumb|400px|right|[[Generalised suffix tree]] for the strings "ABAB", "BABA" and "ABBA", numbered 0, 1 and 2.]]
+The longest common substrings of a set of strings can be found by building a [[generalised suffix tree]] for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it. The figure on the right is the suffix tree for the strings "ABAB", "BABA" and "ABBA", padded with unique string terminators, to become "ABAB$0", "BABA$1" and "ABBA$2". The nodes representing "A", "B", "AB" and "BA" all have descendant leaves from all of the strings, numbered 0, 1 and 2.
+Building the suffix tree takes <math>\Theta(N)</math> time (if the size of the alphabet is constant). If the tree is traversed from the bottom up with a bit vector telling which strings are seen below each node, the k-common substring problem can be solved in <math>\Theta(NK)</math> time. If the suffix tree is prepared for constant time [[lowest common ancestor]] retrieval, it can be solved in <math>\Theta(N)</math> time.<ref name="Gus97">{{cite book | last = Gusfield | first = Dan | origyear = 1997 | year = 1999 | title = Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology | publisher = Cambridge University Press | location = USA | isbn = 0-521-58519-8}}</ref>
+===[[Dynamic programming]]===
+First find the longest common [[substring#Suffix|suffix]] for all pairs of [[substring#Prefix|prefixes]] of the strings. The longest common suffix is
+<math>
+\mathit{LCSuff}(S_{1..p}, T_{1..q}) =
+\begin{cases}
+       \mathit{LCSuff}(S_{1..p-1}, T_{1..q-1}) + 1  & \mathrm{if } \; S[p] = T[q] \\
+                                            & \mathrm{otherwise}.
+\end{cases}
+</math>
+For the example strings "ABAB" and "BABA":
+{| class="wikitable" style="text-align:center"
+|-
+! width="15" | !! width="15" | !! width="15" |A !! width="15" |B !! width="15" |A !! width="15" |B
+|-
+| || 0 || 0 || 0 || 0 || 0
+|-
+! B
+| 0 || 0 || style="color:red" |1 || 0 || 1
+|-
+! A
+| 0 || style="color:red" |1 || 0 || style="color:red" |2 || 0
+|-
+! B
+| 0 || 0 || style="color:red" |2 || 0 || style="color:red" |3
+|-
+! A
+| 0 || 1 || 0 || style="color:red" | 3 || 0
+|}
+The maximal of these longest common suffixes of possible prefixes must be the longest common substrings of ''S'' and ''T''. These are shown on diagonals, in red, in the table. For this example, the longest common substrings are "BAB" and "ABA".
+:<math>
+\mathit{LCSubstr}(S, T) = \max_{1 \leq i \leq m, 1 \leq j \leq n} \mathit{LCSuff}(S_{1..i}, T_{1..j}) \;
+</math>
+This can be extended to more than two strings by adding more dimensions to the table.
+==Pseudocode==
+{{Wikibooks|Algorithm implementation|Strings/Longest common substring|Longest common substring}}
+The following pseudocode finds the set of longest common substrings between two strings with dynamic programming:
+ '''function''' LCSubstr(S[1..m], T[1..n])
+     L := '''array'''(1..m, 1..n)
+     z := 0
+     ret := {}
+     '''for''' i := 1..m
+         '''for''' j := 1..n
+             '''if''' S[i] == T[j]
+                 '''if''' i == 1 or j == 1
+                     L[i,j] := 1
+                 '''else'''
+                     L[i,j] := L[i-1,j-1] + 1
+                 '''if''' L[i,j] > z
+                     z := L[i,j]
+                     ret := {S[i-z+1..i]}
+                 '''elif''' L[i,j] == z
+                     ret := ret &cup; {S[i-z+1..i]}
+             '''else''' L[i,j]=0;
+     '''return''' ret
+This algorithm runs in <math>O(n m)</math> time. The variable <code>z</code> is used to hold the length of the longest common substring found so far. The set <code>ret</code> is used to hold the set of strings which are of length <code>z</code>. The set <code>ret</code> can be saved efficiently by just storing the index <code>i</code>, which is the last character of the longest common substring (of size z) instead of <code>S[i-z+1..z]</code>. Thus all the longest common substrings would be, for each i in <code>ret</code>, <code>S[(ret[i]-z)..(ret[i])]</code>.
+The following tricks can be used to reduce the memory usage of an implementation:
+* Keep only the last and current row of the DP table to save memory (<math>O(\min(m, n))</math> instead of <math>O(n m)</math>)
+* Store only non-zero values in the rows. This can be done using hash tables instead of arrays. This is useful for large alphabets.
+==See also==
+*[[Longest palindromic substring]]
+==References==
+<references/>
+==External links==
+*[http://nist.gov/dads/HTML/longestCommonSubstring.html Dictionary of Algorithms and Data Structures: longest common substring]
+*[http://metacpan.org/module/String::LCSS_XS Perl/XS implementation of the dynamic programming algorithm]
+*[http://metacpan.org/module/Tree::Suffix Perl/XS implementation of the suffix tree algorithm]
+*[http://en.wikibooks.org/wiki/Algorithm_implementation/Strings/Longest_common_substring Dynamic programming implementations in various languages on wikibooks]
+*[http://www.emanueleferonato.com/2010/12/01/solving-the-longest-common-substring-problem-with-as3/ working AS3 implementation of the dynamic programming algorithm]
+[[Category:Problems on strings]]
+[[Category:Dynamic programming]]

Empty domain: Difference between revisions

Revision as of 01:59, 31 December 2013

Contents

Example

Problem definition

Algorithms

Suffix tree

Dynamic programming

Pseudocode

See also

References

External links

Navigation menu

Empty domain: Difference between revisions

Revision as of 01:59, 31 December 2013

Example

Problem definition

Algorithms

Suffix tree

Dynamic programming

Pseudocode

See also

References

External links

Navigation menu

Search