Databases
StackOverflow2013
Postsdbo
POstring pattern match,the suffix array can solve this or have more solution?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POstring pattern match,the suffix array can solve this or have more solution?
    primarykey
    data
    text
    <p>i have a string that random generate by a special characters (B,C,D,F,X,Z),for example to generate a following string list:</p> <pre><code>B D Z Z Z C D C Z B D C B Z Z Z D X D B Z F Z B D C C Z B D C F Z .......... </code></pre> <p>i also have a pattern list, that is to match the generate string and return a best pattern and extract some string from the string.</p> <p><strong>string pattern</strong></p> <pre><code>B D C [D must appear before the C &gt;&gt; DC] B C F B D C F B X [if string have X,must be matched.] ....... </code></pre> <p>for example,</p> <p><code>B D Z Z Z C D C Z</code>,that have <code>B</code> and <code>DC</code>,so that can match by <code>B D C</code></p> <p><code>D B Z C F</code>,that have <code>B</code> and <code>C</code> and <code>F</code>,so that can match by <code>B C F</code></p> <p><code>D B Z D F</code>,that have <code>B</code> and <code>F</code>,so that can match by <code>B F</code></p> <p>.......</p> <p>now,i just think about <code>suffix array</code>.</p> <p>1.first convert a string to suffix array object.</p> <p>2.loop each a pattern,that find which suffix array can be matched.</p> <p>3.compare all matched patterns and get which is a best pattern.</p> <pre><code>var suffix_array=Convert a string to suffix array. var list=new List(); for (int i=0;i&lt;pattern length;i++){ if (suffix_array.match(pattern)) list.Add(pattern); } var max=list[0]; for (int i=1;i&lt;list.length;i++){ { if (list[i]&gt;max) max=list[i]; Write(list[i]); } </code></pre> <p>i just think this method is to complex,that need to build a tree for a pattern ,and take it to match suffix array.who have a more idea?</p> <p>====================update</p> <p>i get a best solution now,i create a new class,that have a B,C,D,X...'s property that is array type.each property save a position that appear at the string. now,if the B not appear at the string,we can immediately end this processing. we can also get all the C and D position,and then compare it whether can sequential appear(DC,DCC,CCC....)</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USzhengchun
    1. USzhengchun
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POstring pattern match,the suffix array can solve this or have more solution?
      1. This table or related slice is empty.
      1. VTUpMod
    1. CODo you interested in all possible patterns? If you just want best pattern for match determine your definition of your best pattern, e.g B D B C F can match both BDC and BCF.
      singulars
      1. POstring pattern match,the suffix array can solve this or have more solution?
      1. USSaeed Amiri
    2. COIf I understand this correctly, you expect the pattern "B F" to match a string such as "C B A F", because "B" and "F" appear in it in the order "B first, then F", even though their occurrences are not ajacent. Is my understanding correct? (If it is, that will make it rather non-trivial to figure out a suffix-array based algorithm to solve this.)
      singulars
      1. POstring pattern match,the suffix array can solve this or have more solution?
      1. USjogojapan
    3. COyes,they are not ajacent.
      singulars
      1. POstring pattern match,the suffix array can solve this or have more solution?
      1. USzhengchun
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload