International Journal of Genomics
Volume 2015 (2015), Article ID 259320, 10 pages
http://dx.doi.org/10.1155/2015/259320

Research Article

SimpLiFiCPM: A Simple and Lightweight Filter-Based Algorithm for Circular Pattern Matching

Md. Aashikur Rahman Azim,¹ Costas S. Iliopoulos,² M. Sohel Rahman,¹ and M. Samiruzzaman²

¹AℓEDA Group, Department of CSE, Bangladesh University of Engineering & Technology, Dhaka 1215, Bangladesh
²Department of Informatics, King's College London, Strand, London WC2R 2LS, UK

Received 8 February 2015; Accepted 21 March 2015

Academic Editor: Chun-Yuan Lin

Copyright © 2015 Md. Aashikur Rahman Azim et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

This paper deals with the circular pattern matching (CPM) problem, which appears as an interesting problem in many biological contexts. CPM consists in finding all occurrences of the rotations of a pattern of length in a text of length . In this paper, we present SimpLiFiCPM (pronounced “Simplify CPM”), a simple and lightweight filter-based algorithm to solve the problem. We compare our algorithm with the state-of-the-art algorithms and the results are found to be excellent. Much of the speed of our algorithm comes from the fact that our filters are effective but extremely simple and lightweight.

1. Introduction

The classical pattern matching problem is to find all the occurrences of a given pattern of length in a text of length , both being sequences of characters drawn from a finite character set . This problem is interesting as a fundamental computer science problem and is a basic requirement of many practical applications. The circular pattern, denoted by , corresponding to a given pattern , is formed by connecting with and forming a sort of a cycle; this gives us the notion where the same circular pattern can be seen as different linear patterns, which would all be considered equivalent. In the circular pattern matching (CPM) problem, we are interested in pattern matching between the text and the circular pattern of a given pattern . We can view as a set of patterns starting at positions and wrapping around the end. In other words, in CPM, we search for all “conjugates” (two words are conjugate if there exist words such that and ) of a given pattern in a given text.

The problem of circular pattern matching has been considered in [1], where an -time algorithm is presented. A naive solution with quadratic complexity consists in applying a classical algorithm for searching a finite set of strings after having built the trie of rotations of . The approach presented in [1] consists in preprocessing by constructing a suffix automaton of the string , by noting that every rotation of is a factor of . Then, by feeding into the automaton, the lengths of the longest factors of occurring in can be found by the links followed in the automaton in time . In [2], the authors have presented an optimal average-case algorithm for CPM, by also showing that the average-case lower bound for the (linear) pattern matching of also holds for CPM, where . Recently, in [3], the authors have presented two fast average-case algorithms based on word-level parallelism. The first algorithm requires average-case time , where is the number of bits in the computer word. The second one is based on a mixture of word-level parallelism and -grams. The authors have shown that with the addition of -grams, and by setting , an optimal average-case time of can be achieved. Very recently in [4], the authors have presented an efficient algorithm for CPM that runs in time on average. To the best of our knowledge, this is the fastest running algorithm for CPM in practice to date.

Notably, indexing circular patterns [5] and variations of approximate circular pattern matching under the edit distance model [6] have also been considered in the literature. Approximate circular pattern matching has also been studied recently in [4, 7]. In this paper however, we focus on the exact version of CPM.

Apart from being interesting from the pure combinatorial point of view, CPM has applications in areas like geometry, astronomy, computational biology, and so forth. For example, the following application in geometry was discussed in [5]. A polygon may be encoded spelling its coordinates. Now, given the data stream of a number of polygons, we may need to find out whether a desired polygon exists in the data stream. The difficulty in this situation lies in the fact that the same polygon may be encoded differently depending on its “starting” coordinate and hence, there exist possible encodings where is the number of vertices of the polygon. Therefore, instead of traditional pattern matching, we need to resort to problem CPM. This problem seems to be useful in computer graphics as well and hence may be used as a built-in function in graphics cards handling polygon rendering.

CPM in fact appears in many biological contexts. This type of circular pattern occurs in the DNA of viruses [9, 10], bacteria [11], eukaryotic cells [12], and archaea [13]. As a result, as has been noted in [14], algorithms on circular strings seem to be important in the analysis of organisms with such structures. Circular strings have also been studied in the context of sequence alignment. In [15], basic algorithms for pairwise and multiple circular sequence alignment have been presented. These results have later been improved in [16], where an additional preprocessing stage is added to speed up the execution time of the algorithm. In [17], the authors also have presented efficient algorithms for finding the optimal alignment and consensus sequence of circular sequences under the Hamming distance metric.

Furthermore, as has been mentioned in [5], this problem seems to be related to the much studied swap matching problem (in CPM, the patterns can be thought of as having a swap of two parts of it) [18] and also to the problem of pattern matching with address error (the circular pattern can be thought of as having a special type of address error) [19, 20]. For further details on the motivation and applications of this problem in computational biology and other areas the readers are kindly referred to [9–17] and references therein.

In this paper, we present SimpLiFiCPM (pronounced Simplify CPM), which is a fast and efficient algorithm for the circular pattern matching problem based on some filtering techniques. In particular, we employ a number of simple and effective filters to preprocess the given pattern and the text. After this preprocessing, we get a text of reduced length on which we can apply any existing state-of-the-art algorithms to get the occurrences of the circular pattern. So, as the name sounds, SimpLiFiCPM, in some sense, simplifies the search space of the circular pattern matching problem.

We have conducted extensive experiments to compare our algorithm with the state-of-the-art algorithms and the results are found to be excellent. Our algorithm turns out to be much faster in practice because of the huge reduction in the search space through filtering. Also, the filtering techniques we use are simple and lightweight but as can be realized from the results extremely effective.

The rest of the paper is organized as follows. Section 2 gives a preliminary description of some terminologies and concepts related to stringology that will be used throughout this paper. In Section 3 we describe our filtering algorithms. Section 4 presents the experimental results. Section 5 draws conclusion followed by some future research directions.

2. Preliminaries

Let be a finite alphabet. An element of is called a string. The length of a string is denoted by . The empty string is a string of length ; that is, . Let . For a string , , , and are called a prefix, factor (or, equivalently, substring), and suffix of , respectively. The th character of a string is denoted by for , and the factor of a string that begins at position and ends at position is denoted by for . For convenience, we assume if . A -factor is a factor of length .

A circular string of length can be viewed as a traditional linear string which has the leftmost and rightmost symbols wrapped around and stuck together in some way. Under this notion, the same circular string can be seen as different linear strings, which would all be considered equivalent. Given a string of length , we denote by , , the th rotation of and .

Example 1. Suppose we have a pattern . The pattern has the following rotations (i.e., conjugates): ,  ,  ,  ,  , and  .

Here we consider the problem of finding occurrences of a pattern string of length with circular structure in a text string of length with linear structure. For instance, the DNA sequence of many viruses has a circular structure. So if a biologist wishes to find occurrences of a particular virus in a carrier’s DNA sequence, which may not be circular, (s)he must locate all positions in where at least one rotation of occurs. This is the problem of circular pattern matching (CPM).

We consider the DNA alphabet, that is, . In our approach, each character of the alphabet is associated with a numeric value as follows. Each character is assigned a unique number from the range . Although this is not essential, we conveniently assign the numbers from the range to the characters of following their inherent lexicographical order. We use , to denote the numeric value of the character . So, we have , , , and . For a string , we use the notation to denote the numeric representation of the string ; denotes the numeric value of the character . So, if then . The concept of circular strings and their rotations also applies naturally on their numeric representations as is illustrated in Example 2 below.

Example 2. Suppose we have a pattern . The numeric representation of is . And this numeric representation has the following rotations: , , , , , and .

The problem we handle in this paper can be formally defined as follows.

Problem 3 (circular pattern matching (CPM)). Given a pattern of length and a text of length , find all factors of such that , for some . And if we have for some , then we say that the circular pattern matches at position .

In the context of our filter-based algorithm the concept of false positives and negatives is important. So, we briefly discuss this concept here. Suppose we have an algorithm to solve a problem . Now suppose that represents the set of true solutions for problem . Further suppose that computes the set as the set of solutions for . Now assume that . Then, the set of false positives can be computed as follows: , where “” refers to the set difference operation. In other words, the set computed by contains some solutions that are not true solutions for problem . And these are the false positives, because falsely marked these as solutions (i.e., positive). On the other hand, the set of false negatives can be computed as follows: . In other words, false negatives are those members in that are absent in . These are false negatives because falsely marked these as nonsolutions (i.e., negative).

3. Our Approach

As has been mentioned above, our algorithm is based on some filtering techniques. Suppose we are given a pattern and a text . We will frequently and conveniently use the expression “ matches at position ” (or, equivalently, “ circularly matches at position ”) to indicate that one of the conjugates of matches at position . We start with a brief overview of our approach below.

3.1. Overview of SimpLiFiCPM

In SimpLiFiCPM, we first employ a number of filters to compute a set of indexes of such that matches at position . As will be clear shortly, our filters are unable to compute the true set of indexes and hence may have false positives. However, our filters are designed in such a way that there are no false negatives. Hence, for all , we can be sure that there is no match. On the other hand, for all , we may or may not have a match; that is, we may have false positives. So, after we have computed , we compute , a reduced version of concatenating all the factors , , putting a special character in between the factors. One essential detail is as follows. There can be , such that . In other words, there can exist overlapping factors matching with . However, this can be handled easily through simple bookkeeping as will be evident from our algorithm in later sections. Clearly, once we have computed the reduced text we can employ any state-of-the-art algorithm to solve CPM on to get the actual occurrences. So the most essential and useful feature of SimpLiFiCPM is the application of filters to get a reduced text on which any existing algorithm can be applied to solve CPM.

3.2. Filters of SimpLiFiCPM

In SimpLiFiCPM, we employ 6 filters. In this section we describe these filters. We also discuss the related notions and notations needed to describe these filters. In what follows we describe our filters in the context of two strings of equal length , namely, and , where the former is a circular string and the latter is linear. We will devise and apply different functions on these strings and present observations related to these functions which in the sequel will lead us to our desired filter. The key to our observations and the resulting filters is the fact that each function we devise results in a unique output when applied to the rotations of a circular string. For example, consider a hypothetical function . We will always have the relation that for all . Recall that actually denotes . For the sake of conciseness, for such functions, we will abuse the notation a bit and use to represent for all .

3.2.1. Filter 1

We define the function on a string of length as follows: . Our first filter, Filter 1, is based on this function. We have the following observation.

Observation 1. Consider a circular string and a linear string both having length . If matches , then we must have .

Example 4. Consider . As can be easily verified, here circularly matches . In fact the match is due to the conjugate . Now we have and . Then, according to Observation 1, we must have . This can indeed be verified easily.
Now consider another string , which is slightly different from . It can be easily verified that does not match . Now, and hence here also we have . This is an example of a false positive with respect to Filter 1.

3.2.2. Filters 2 and 3

Our second and third filters, that is, Filters 2 and 3, depend on a notion of distance between consecutive characters of a string. The distance between two consecutive characters of a string of length is defined by , where . We define . We also define an absolute version of it: , where returns the magnitude of ignoring the sign. Before we apply these two functions on our strings to get our filters, we need to do a simple preprocessing on the respective string, that is, in this case as follows. We extend the string by concatenating the first character of at its end. We use to denote the resultant string. So, we have . Since can simply be treated as another string, we can easily extend the notation and concept of over and we continue to abuse the notation a bit for the sake of conciseness as mentioned at the beginning of Section 3.2 (just before Section 3.2.1).

Now we have the following observation which is the basis of our Filter 2.

Observation 2. Consider a circular string and a linear string both having length and assume that and . If matches , then, we must have . Note carefully that the function has been applied on the extended strings.

Example 5. Consider the same two strings of Example 4, that is, . Here circularly matches (due to the conjugate ). Now consider the extended strings and assume that and . We have . Hence . Hence, . It can be easily verified that is also 14.
Now consider another string of the same length, which is slightly different from . It can easily be checked that does not match . However, assuming that we find that is still 14. So, this is an example of a false positive with respect to Filter 2.
Now we present the following related observation which is the basis of our Filter 3. Note that Observation 2 differs with Observation 3 only through using the absolute version of the function used in the latter.

Observation 3. Consider a circular string and a linear string both having length and assume that and . If matches , then, we must have . Note carefully that the function has been applied on the extended strings.

Example 6. Consider the same two strings of previous examples, that is, . Here circularly matches (due to the conjugate ). Now consider the extended strings and assume that and . We have . Hence . Hence, . It can be easily verified that is also 0.
Now consider another string of the same length, which is slightly different from . It can easily be checked that does not match . However, assuming that we find that is still 0. So, this is an example of a false positive with respect to Filter 3.

3.2.3. Filter 4

Filter 4 uses the function used by Filter 1, albeit in a slightly different way. In particular, it applies the function on individual characters. So, for we define . Now we have the following observation.

Observation 4. Consider a circular string and a linear string both having length . If matches , then, we must have for all .

Example 7. Consider the same two strings of previous examples, that is, . Recall that circularly matches (due to the conjugate ). It is easy to calculate that , , , and . Hence according to Observation 4, the individual sum values for all the conjugates of must also match this. It can be easily verified that this is indeed the case.
Now consider the other string of the same length, which is slightly different from . It can easily be checked that does not match . However, as we can see, still we have , , , and . This is an example of a false positive with respect to Filter 4.

Notably, a similar idea has been used by Kahveci et al. in [21] for indexing large strings with a goal to achieve fast local alignment of large genomes. In particular, for a DNA string, Kahveci et al. compute the so-called frequency vector that keeps track of the frequency of each character of the DNA alphabet in the string.

3.2.4. Filter 5

Filter 5 depends on modulo operation between two consecutive characters. A modulo operation between two consecutive characters of a string of length is defined as follows: , where . We define to be the summation of the results of the modulo operations on the consecutive characters of . More formally, . Now we present the following observation which is the basis of Filter 5. Note that this observation is applied on the extended versions of the respective strings.

Observation 5. Consider a circular string and a linear string both having length and assume that and . If matches , then, we must have . Note carefully that the function has been applied on the extended strings.

Example 8. Consider the same two strings of previous examples, that is, . Recall that circularly matches (due to the conjugate ). Now consider the extended strings and assume that and . We have . Hence . Hence, . Now according to Observation 5, we must also have . This is indeed true.
Now consider another string of the same length, which is different from . It can easily be checked that does not match . However, assuming that we find that is still 5. So, this is an example of a false positive with respect to Filter 5.

3.2.5. Filter 6

In Filter 6 we employ the operation. A bitwise exclusive-OR () operation between two consecutive characters of a string of length is defined as follows: , where . We define to be the summation of the results of the xor operations on the consecutive characters of . More formally, . Now we present the following observation which is the basis of Filter 6. Note that this observation is applied on the extended versions of the respective strings.

Observation 6. Consider a circular string and a linear string both having length and assume that and . If matches , then, we must have . Note carefully that the function has been applied on the extended strings.

Example 9. Consider the same two strings of previous examples, that is, . Recall that circularly matches (due to the conjugate ). Now consider the extended strings and assume that and . We have . Hence . Hence, . Now according to Observation 5, we must also have . As can be verified easily, this is indeed the case.
Now consider another string of the same length, which is different from . It can easily be checked that does not match . However, assuming that we find that is still 28. So, this is an example of a false positive with respect to Filter 5.

3.2.6. Discussion with respect to [8]

At this point a brief discussion with respect to our preliminary work in [8] is in order. To reduce the text , we also employed six filters in [8]. While Filter 1 and Filter 4 remain identical, in SimpLiFiCPM, we have changed and improved Filters , , , and to get better results. In particular, we have introduced the concept of extended string here and modified the filters accordingly. Much of the efficiency of these new filters comes from the fact that in the preliminary version, without the extended strings, we had to deal with a set of values as the output of the functions creating a small bottleneck. On the contrary, SimpLiFiCPM now needs to deal with only one value as the output of the functions of Filters 2, 3, 5, and 6. This makes SimpLiFiCPM even faster than its predecessor. This is evident from the experimental results presented later. Notably, this has essentially brought some more changes in the overall algorithm. In particular in the searching phase of the algorithm we now need to adapt accordingly to apply the corresponding filters on the extended strings. But the overall improvement outweighs this extra work by a long margin.

3.3. Circular Pattern Signature Using the Filters

In this section, we discuss an -time algorithm that SimpLiFiCPM uses to compute the signature of the circular pattern corresponding to pattern of length . This signature is used at a later stage to filter the text. Here, we need five variables to save the output of the functions used for Filters 1, 2, 3, 5, and 6 (based on Observations 1, 2, 3, 5, and 6). And we need a list of size 4 to save the values of the function used in Filter 4 (Observation 4). We start with the extended string and compute the values according to Observations 1 to 6. The algorithm will iterate times and hence the overall runtime of the algorithm is . The algorithm is presented in Procedure (Algorithm 1).

) procedure   1 : 

()        define five varibles for Observations 1, 2, 3, 5, and 6

()        define an array of size 4 for Observation 4

()        define an array of size 4 to keep fixed value of A, C, G, T

()        1 : 

()        initialize all defined variables to zero

()        initialize fixed array to

()        for   to   do

()            if     then

()                calculate different filtering values via Observations 1 and 4 and make a running sum

()           end if

()           calculate different filtering values via Observations 2, 3, 5, and 6 and make a running sum

()      end for

()      return all observations values

() end procedure

Algorithm 1: Exact circular pattern signature using Observations 1–6 in a single pass.

3.4. Reduction of Search Space in the Text

Now we present an runtime algorithm that SimpLiFiCPM uses to reduce the search space of the text applying the six filters presented above. It takes as input the pattern of length and the text of length . It calls Procedure with as parameter and uses the output. It then applies the same technique that is applied in Procedure (Algorithm 1). We apply a sliding window approach with window length of and calculate the values applying the functions according to Observations 1–6 on the factor of captured by the window. Note that, for Observations 2, 3, 5, and 6, we need to consider the extended string and hence the factor of within the window need be extended accordingly for calculating the values. After we calculate the values for a factor of , we check it against the returned values of Procedure . If it matches, then we output the factor to a file. Note that, in case of overlapping factors (e.g., when the consecutive windows need to output the factors to a file), Procedure outputs only the nonoverlapped characters. And Procedure uses a marker to mark the boundaries of nonconsecutive factors, where .

Now note that we can compute the values of consecutive factors of using the sliding window approach quite efficiently as follows. For the first factor, that is, , we exactly follow the strategy of Procedure . When it is done, we slide the window by one character and we only need to remove the contribution of the leftmost character of the previous window and add the contribution of the rightmost character of the new window. The functions are such that this can be done very easily using simple constant time operations. The only other issue that needs to be taken care of is due to the use of the extended string in four of the filters. But this too does not need more than simple constant time operations. Therefore, overall runtime of the algorithm is . The algorithm is presented in the form of Procedure (Algorithm 2).

() Procedure   , 1 : 

()        CALL  ECPS_FT 1 : 

()        save the return value of Observations 1–6 for further use here

()        define an array of size 4 to keep fixed value of A, C, G, T

()        initialize fixed array to

()        

()        for   to   do

()            calculate different filtering values in via Observations 1–6 and make a running sum

()        end for

()       if 1–6 observations values of  :  vs 1–6 observations values of 1 :  have a match then

()                                                                                 Found a filtered match

()            Output to file

()            

()       end if

()       for   to   do

()            calculate different filtering values in 1 :  via Observations 1–6 by subtracting th value along with

                    wrapped value and adding th value and new wrapped value to the running sum

()            if 1–6 filtering values of 1 :  vs 1–6 filtering values of have a match then

()                                                                                 Found a filtered match

()                if     then

()                    Output an end marker $ to file

()                end if

()                if     then

()                    if     then

()                        

()                    else

()                        

()                    end if

()                    Output to file  : 

()                    lastIndex

()                end if

()        end if

()     end for

() end procedure

Algorithm 2: Reduction of search space in a text string using Procedure ECPS_FT.

3.5. The Combined SimpLiFiCPM Algorithm

In this section we combine the algorithms presented so far and present the complete view of SimpLiFiCPM. We have already described the two main components of SimpLiFiCPM, namely, Procedure and Procedure , that in fact calls the former. Now Procedure provides a reduced text (say) after filtering. At this point SimpLiFiCPM can use any algorithm that can solve CPM and apply it over and output the occurrences. Now, suppose SimpLiFiCPM uses algorithm at this stage which runs in time. Then, clearly, the overall running time of SimpLiFiCPM is . For example, if SimpLiFiCPM uses the linear time algorithm of [1], then clearly the overall theoretical running time of SimpLiFiCPM will be .

In our implementation however we have used the recent algorithm of [4], which is a linear time algorithm on average and the fastest algorithm in practice to the best of our knowledge. In particular, in [4], the authors have presented an approximate circular string matching algorithm with -mismatches (ACSMF-Simple) via filtering. They have built a library for ACSMF-Simple algorithm. The library is freely available and can be found in [22]. In this algorithm, if we set , then ACSMF-Simple works for the exact matching case. In what follows, we will refer to this algorithm as ACSMF-SimpleZero. We have implemented SimpLiFiCPM using ACSMF-SimpleZero; that is, we have used ACSMF-Simple algorithm simply by putting .

3.6. An Illustrative Example

Now that we have fully described SimpLiFiCPM, in this section we present the simulation of SimpLiFiCPM on a particular example. We only show the simulation up to the output of Procedure , that is, the output of the reduced text, because afterwards we can employ any state-of-the-art algorithm within SimpLiFiCPM. Consider a pattern . The values computed by Procedure according to Observations 1 through 6 are as follows, respectively: , , , , , and .

Again consider a text string . For the first sliding window we need to calculate the observation values from . The observation values according to Procedure are as follows for : , , , , , and .

The length of is . And the length of is . So, the algorithm iterates exactly = times. Each iteration is illustrated in Table 1.

Table 1: An example simulation of SimpLiFiCPM.

Iteration
Local total sum
abs sum
Actual sum
Local individual sum 0 : 4
modulas sum
xor sum
Does it match with pattern?
Output file

1
18
14
0
{2, 2, 6, 8}
5
28
YES
tgatcga

2
15
12
0
{3, 2, 6, 4}
4
18
NO
$

3
13
8
0
{4, 2, 3, 4}
3
14
NO

4
15
8
0
{3, 2, 6, 4}
6
18
NO

5
15
8
0
{3, 2, 6, 4}
6
18
NO

6
14
10
0
{4, 0, 6, 4}
5
18
NO

7
12
6
0
{5, 0, 3, 4}
4
14
NO

8
15
12
0
{4, 0, 3, 8}
5
24
NO

9
16
12
0
{3, 2, 3, 8}
5
28
NO

10
18
10
0
{2, 2, 6, 8}
6
24
NO

11
16
14
0
{3, 2, 3, 8}
4
24
NO

12
16
14
0
{3, 2, 3, 8}
4
24
NO

13
18
14
0
{2, 2, 6, 8}
5
28
YES
atcgatg

4. Experimental Results

We have implemented SimpLiFiCPM and conducted extensive experiments to analyze its performance. We have coded SimpLiFiCPM in C++ using a GNU compiler with General Public License (GPL). Our code is available at [23]. As has been mentioned already above, our implementation of SimpLiFiCPM uses the ACSMF-SimpleZero [4]. ACSMF-Simple [4] has been implemented as library functions in the C programming language under GNU/Linux operating system. The library implementation is distributed under the GNU General Public License (GPL). It takes as input the pattern of length , the text of length , and the integer threshold and returns the list of starting positions of the occurrences of the rotations of in with -mismatches as output. In our case we use .

We have used real genome data in our experiments as the text string, . This data has been collected from [24]. Here, we have taken 299 MB of data for our experiments. We have generated random patterns of different length by a random indexing technique in these 299 MB of text string.

We have conducted our experiments on a PowerEdge R820 rack serve PC with 6-core Intel Xeon processor E5-4600 product family and 64 GB of RAM under GNU/Linux. With the help of the library used in [4], we have compared the running time of our preliminary work in [8] (referred to as Filter-CPM henceforth), ACSMF-SimpleZero of [4], and SimpLiFiCPM. Table 2 reports the elapsed time and speed-up comparisons for various pattern sizes . As can be seen from Table 2, Filter-CPM [8] runs faster than ACSMF-SimpleZero in all cases. And in fact Filter-CPM [8] achieves a minimum of twofold speed-up for all the pattern sizes. Again, referring to the same table, SimpLiFiCPM runs even faster than ACSMF-SimpleZero in all cases. And in fact SimpLiFiCPM achieves a minimum of threefold speed-up for all the pattern sizes.

Table 2: Elapsed time (in seconds) of and speed-up comparisons among Filter-CPM [8], ACSMF-SimpleZero [4], and SimpLiFiCPM on a text of size 299 MB.

Elapsed time (s) of ACSMF-SimpleZero
Elapsed time (s) of Filter-CPM
Speed-up: ACSMF-SimpleZero versus Filter-CPM
Elapsed time (s) of SimpLiFiCPM
Speed-up: ACSMF-SimpleZero versus SimpLiFiCPM

500
5.938
3.025
2
1.167
5

550
7.914
3.068
3
1.456
5

600
7.691
3.06
3
1.364
6

650
7.836
3.074
3
1.006
8

700
7.739
3.072
3
1.028
8

750
7.82
3.051
3
1.073
7

800
7.839
3.209
2
1.04
8

850
8.382
3.053
3
1.055
8

900
7.646
3.055
3
1.278
6

950
7.876
3.049
3
1.402
6

1000
7.731
3.067
3
1.216
6

1600
7.334
3.206
2
1.182
6

1650
8.239
3.063
3
0.969
9

1700
7.572
3.059
2
1.18
6

1750
5.968
3.066
2
1.144
5

1800
7.551
3.064
2
1.179
6

1850
7.407
3.079
2
1.086
7

1900
7.861
3.225
2
1.126
7

1950
7.339
3.073
2
1.028
7

2000
7.814
3.062
3
1.118
7

2050
5.969
3.057
2
1.988
3

2100
5.173
3.036
2
1.187
4

2150
5.317
3.027
2
1.919
3

2200
6.032
3.168
2
1.927
3

2250
5.009
3.073
2
1.895
3

2300
5.029
3.024
2
1.891
3

2350
5.041
3.047
2
1.887
3

2400
6.036
3.046
2
1.91
3

2450
6.04
3.037
2
1.886
3

2500
7.046
3.029
2
1.976
4

2550
7.042
3.037
2
1.987
4

2600
8.043
4.029
2
2.883
3

2650
8.049
4.03
2
2.884
3

2700
8.031
4.183
2
2.892
3

2750
8.039
4.044
2
2.882
3

2800
9.026
4.067
2
2.886
3

2850
9.154
4.036
2
2.901
3

2900
10.049
4.045
2
3.134
3

2950
11.044
5.052
2
3.876
3

3000
12.044
6.039
2
3.9
3

In order to analyze and understand the effect of our filters we have run a second set of experiments as follows. We have run experiments on three variants of SimpLiFiCPM where the first variant (SimpLiFiCPM-) only employs Filters 1 through 3, the second variant (SimpLiFiCPM-) only employs Filters 1 through 4, and finally the third variant (SimpLiFiCPM-) employs Filters 1 through 5. Table 2 reports the elapsed time and speed-up comparisons considering various pattern sizes for ACSMF-SimpleZero and the above-mentioned three variants of SimpLiFiCPM. As can be seen from Table 3, ACSMF-SimpleZero is able to beat SimpLiFiCPM- in a number of cases. However, SimpLiFiCPM- and SimpLiFiCPM- significantly run faster than ACSMF-SimpleZero in all cases.

Table 3: Elapsed time (in seconds) of and speed-up comparisons among ACSMF-SimpleZero and three variants of SimpLiFiCPM (considering different combination of the filters) for a text of size 299 MB.

Filters to
Filters to
Filters to

Elapsed time (s) of ACSMF-SimpleZero
Elapsed time (s) of SimpLiFiCPM-
Speed-up: ACSMF-SimpleZero versus SimpLiFiCPM-
Elapsed time (s) of ACSMF-SimpleZero
Elapsed time (s) of SimpLiFiCPM-
Speed-up: ACSMF-SimpleZero versus SimpLiFiCPM-
Elapsed time (s) of ACSMF-SimpleZero
Elapsed time (s) of SimpLiFiCPM-
Speed-up: ACSMF-SimpleZero versus SimpLiFiCPM-

500
6.355
3.522
2
6.373
4.973
1
6.397
2.523
3

550
8.526
20.43
0
8.564
4.866
2
8.38
2.545
3

600
8.149
43.544
0
8.286
4.902
2
8.359
2.518
3

650
8.315
4.35
2
8.448
4.894
2
8.324
2.47
3

700
9.063
7.596
1
8.71
4.9
2
8.249
2.493
3

750
8.399
6.837
1
8.643
5.101
2
8.326
2.478
3

800
8.357
16.293
1
8.346
4.915
2
8.265
2.48
3

850
8.79
10.651
1
8.309
4.924
2
8.48
2.562
3

900
7.959
23.181
0
8.411
4.916
2
8.223
2.525
3

950
8.652
15.443
1
8.552
4.93
2
8.678
2.519
3

1000
8.285
12.399
1
8.371
4.916
2
8.375
2.616
3

1600
7.846
6.074
1
7.927
4.915
2
7.872
2.529
3

1650
8.918
2.691
3
8.878
4.904
2
8.854
2.523
4

1700
7.839
6.506
1
7.697
4.897
2
7.8
2.522
3

1750
6.252
30.173
0
6.523
5.09
1
6.399
2.526
3

1800
8.643
26.655
0
8.218
4.918
2
8.143
2.487
3

1850
8.072
2.901
3
8.026
4.901
2
8.095
2.532
3

1900
8.442
30.468
0
8.495
4.927
2
8.297
2.516
3

1950
8.123
2.542
3
8.367
4.927
2
7.951
2.495
3

2000
8.366
12.175
1
8.58
5.13
2
8.394
2.533
3

5. Conclusions

In this paper, we have employed some effective lightweight filtering technique to reduce the search space of the circular pattern matching (CPM) problem. We have presented SimpLiFiCPM, an extremely fast algorithm based on the above-mentioned filters. We have conducted extensive experimental studies to show the effectiveness of SimpLiFiCPM. In our experiments, SimpLiFiCPM has achieved a minimum of threefold speed-up compared to the state-of-the-art algorithms. Much of the speed of our algorithm comes from the fact that our filters are effective but extremely simple and lightweight. The most intriguing feature of SimpLiFiCPM is perhaps its capability to plug in any algorithm to solve CPM and take advantage of it. We are now working towards adapting the filters so that it could work for the approximate version of CPM.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

Part of this research has been supported by an INSPIRE Strategic Partnership Award, administered by the British Council, Bangladesh, for the project titled “Advances in Algorithms for Next Generation Biological Sequences.” M. Sohel Rahman is a Commonwealth Academic Fellow funded by the UK Government who is currently on a sabbatical leave from BUET.

References

M. Lothaire, Applied Combinatorics on Words, Cambridge University Press, New York, NY, USA, 2005.

K. Fredriksson and S. Grabowski, “Average-optimal string matching,” Journal of Discrete Algorithms, vol. 7, no. 4, pp. 579–594, 2009.

K.-H. Chen, G.-S. Huang, and R.. C.-T. Lee, “Bit-parallel algorithms for exact circular string matching,” The Computer Journal, vol. 57, no. 5, pp. 731–743, 2014.

C. Barton, C. S. Iliopoulos, and S. P. Pissis, “Fast algorithms for approximate circular string matching,” Algorithms for Molecular Biology, vol. 9, no. 1, article 9, 2014.

C. S. Iliopoulos and M. S. Rahman, “Indexing circular patterns,” in WALCOM: Algorithms and Computation, S. Nakano and M. S. Rahman, Eds., vol. 4921 of Lecture Notes in Computer Science, pp. 46–57, Springer, Berlin, Germany, 2008.

J. Lin and D. Adjeroh, “All-against-all circular pattern matching,” Computer Journal, vol. 55, no. 7, pp. 897–906, 2012.

R. Susik, S. Grabowski, and S. Deorowicz, “Fast and simple circular pattern matching,” in Man-Machine Interactions 3: Proceedings of the 3rd International Conference on Man-Machine Interactions (ICMMI '13), vol. 242, pp. 537–544, Springer International Publishing, 2014.

M. A. R. Azim, C. S. Iliopoulos, M. S. Rahman, and M. Samiruzzaman, “A fast and lightweight filter-based algorithm for circular pattern matching,” in Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (BCB '14), pp. 621–622, ACM, Newport Beach, Calif, USA, September 2014.

R. Weil and J. Vinograd, “The cyclic helix and cyclic coil forms of polyoma viral DNA,” Proceedings of the National Academy of Sciences of the United States of America, vol. 50, no. 4, pp. 730–738, 1963.

R. Dulbecco and M. Vogt, “Evidence for a ring structure of polyoma virus DNA,” Proceedings of the National Academy of Sciences of the United States of, vol. 50, no. 2, pp. 236–243, 1963.

M. Thanbichler, S. C. Wang, and L. Shapiro, “The bacterial nucleoid: a highly organized and dynamic structure,” Journal of Cellular Biochemistry, vol. 96, no. 3, pp. 506–521, 2005.

G. Lipps, Plasmids: Current Research and Future Trends, Caister Academic Press, Norfolk, UK, 2008.

T. Allers and M. Mevarech, “Archaeal genetics—the third way,” Nature Reviews Genetics, vol. 6, no. 1, pp. 58–73, 2005.

D. Gusfield, Algorithms on Strings, Trees and Sequences, Cambridge University Press, New York, NY, USA, 1997.

A. Mosig, I. Hofacker, P. Stadler, and A. Zell, “Comparative analysis of cyclic sequences: viroids and other small circular RNAs,” in Proceedings of the German Conference on Bioinformatics, vol. 83 of Lecture Notes in Informatics, pp. 93–102, 2006.

F. Fernandes, L. Pereira, and A. T. Freitas, “CSA: an efficient algorithm to improve circular DNA multiple alignment,” BMC Bioinformatics, vol. 10, article 230, 2009.

T. Lee, J. Na, H. Park, K. Park, and J. Sim, “Finding optimal alignment and consensus of circular strings,” in Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21–23, 2010, vol. 6129 of Lecture Notes in Computer Science, pp. 310–322, Springer, Berlin, Germany, 2010.

A. Amir, Y. Aumann, G. M. Landau, M. Lewenstein, and N. Lewenstein, “Pattern matching with swaps,” Journal of Algorithms, vol. 37, no. 2, pp. 247–266, 2000.

A. Amir, Y. Aumann, G. Benson et al., “Pattern matching with address errors: rearrangement distances,” in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '06), pp. 1221–1229, ACM, Miami, Fla, USA, January 2006.

P. Ahmed, C. S. Iliopoulos, A. S. Islam, and M. S. Rahman, “The swap matching problem revisited,” Theoretical Computer Science, vol. 557, pp. 34–49, 2014.

T. Kahveci, V. Ljosa, and A. K. Singh, “Speeding up whole-genome alignment by indexing frequency vectors,” Bioinformatics, vol. 20, no. 13, pp. 2122–2134, 2004.

http://www.inf.kcl.ac.uk/research/projects/asmf/

http://teacher.buet.ac.bd/msrahman/SimpLiFiCPM/

http://hgdownload-test.cse.ucsc.edu/goldenPath/hg19/bigZips/