The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Simone Faro: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Domenico Cantone, Salvatore Cristofaro, Simone Faro
    On Tuning the (\delta, \alpha)-Sequential-Sampling Algorithm for \delta-Approximate Matching with Alpha-Bounded Gaps in Musical Sequences. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2005, pp:454-459 [Conf]
  2. Domenico Cantone, Salvatore Cristofaro, Simone Faro
    Solving the (\delta, \alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2005, pp:460-463 [Conf]
  3. Domenico Cantone, Salvatore Cristofaro, Simone Faro
    Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:33-47 [Conf]
  4. Domenico Cantone, Salvatore Cristofaro, Simone Faro
    On some combinatorial problems concerning the harmonic structure of musical chord sequences. [Citation Graph (0, 0)][DBLP]
    Stringology, 2006, pp:49-64 [Conf]
  5. Domenico Cantone, Salvatore Cristofaro, Simone Faro
    An Efficient Algorithm for alpha-Approximate Matching with delta-Bounded Gaps in Musical Sequences. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:428-439 [Conf]
  6. Domenico Cantone, Simone Faro
    Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:47-58 [Conf]
  7. Domenico Cantone, Simone Faro
    A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1235-1252 [Journal]
  8. Domenico Cantone, Simone Faro
    A space efficient bit-parallel algorithm for the multiple string matching problem. [Citation Graph (0, 0)][DBLP]
    Stringology, 2005, pp:109-124 [Conf]

  9. An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. [Citation Graph (, )][DBLP]


  10. A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. [Citation Graph (, )][DBLP]


  11. Pattern Matching with Swaps for Short Patterns in Linear Time. [Citation Graph (, )][DBLP]


  12. Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. [Citation Graph (, )][DBLP]


  13. New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences. [Citation Graph (, )][DBLP]


  14. Efficient Variants of the Backward-Oracle-Matching Algorithm. [Citation Graph (, )][DBLP]


  15. Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. [Citation Graph (, )][DBLP]


  16. An Efficient Algorithm for Approximate Pattern Matching with Swaps. [Citation Graph (, )][DBLP]


  17. Finite State Models for the Generation of Large Corpora of Natural Language Texts. [Citation Graph (, )][DBLP]


  18. Bit-(Parallelism)2: Getting to the Next Level of Parallelism. [Citation Graph (, )][DBLP]


  19. A New Algorithm for Efficient Pattern Matching with Swaps. [Citation Graph (, )][DBLP]


  20. Efficient Pattern Matching on Binary Strings [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002