|
Search the dblp DataBase
Raphaël Clifford:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos
Faster Algorithms for delta, gamma-Matching and Related Problems. [Citation Graph (0, 0)][DBLP] CPM, 2005, pp:68-78 [Conf]
- Raphaël Clifford, Marek J. Sergot
Distributed and Paged Suffix Trees for Large Genetic Databases. [Citation Graph (0, 0)][DBLP] CPM, 2003, pp:70-82 [Conf]
- Inbok Lee, Raphaël Clifford, Sung-Ryul Kim
Algorithms on Extended (delta, gamma)-Matching. [Citation Graph (0, 0)][DBLP] ICCSA (3), 2006, pp:1137-1142 [Conf]
- Raphaël Clifford, Manolis Christodoulakis, Tim Crawford, David Meredith, Geraint A. Wiggins
A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval. [Citation Graph (0, 0)][DBLP] ISMIR, 2006, pp:150-155 [Conf]
- Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed
Necklace Swap Problem for Rhythmic Similarity Measures. [Citation Graph (0, 0)][DBLP] SPIRE, 2005, pp:234-245 [Conf]
- Raphaël Clifford, Aaron J. Mackey
Disperse: a simple and efficient approach to parallel database searching. [Citation Graph (0, 0)][DBLP] Bioinformatics, 2000, v:16, n:6, pp:564-565 [Journal]
- Peter Clifford, Raphaël Clifford
Simple deterministic wildcard matching. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:101, n:2, pp:53-54 [Journal]
- Raphaël Clifford
Distributed suffix trees. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2005, v:3, n:2-4, pp:176-197 [Journal]
- Raphaël Clifford, Costas S. Iliopoulos
Approximate string matching for music analysis. [Citation Graph (0, 0)][DBLP] Soft Comput., 2004, v:8, n:9, pp:597-603 [Journal]
- Peter Clifford, Raphaël Clifford
Self-normalised Distance with Don't Cares. [Citation Graph (0, 0)][DBLP] CPM, 2007, pp:63-70 [Conf]
- Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
k -Mismatch with Don't Cares. [Citation Graph (0, 0)][DBLP] ESA, 2007, pp:151-162 [Conf]
- Raphaël Clifford, Benjamin Sach
Fast Approximate Point Set Matching for Information Retrieval. [Citation Graph (0, 0)][DBLP] SOFSEM (1), 2007, pp:212-223 [Conf]
- Raphaël Clifford, Ely Porat
A Filtering Algorithm for k -Mismatch with Don't Cares. [Citation Graph (0, 0)][DBLP] SPIRE, 2007, pp:130-136 [Conf]
- Michael A. Bender, Raphaël Clifford, Kostas Tsichlas
Scheduling Algorithms for Procrastinators [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
A Black Box for Online Approximate Pattern Matching. [Citation Graph (, )][DBLP]
Online Approximate Matching with Non-local Distances. [Citation Graph (, )][DBLP]
Pseudo-realtime Pattern Matching: Closing the Gap. [Citation Graph (, )][DBLP]
From coding theory to efficient pattern matching. [Citation Graph (, )][DBLP]
Mismatch Sampling. [Citation Graph (, )][DBLP]
Generalised Matching. [Citation Graph (, )][DBLP]
The Complexity of Flood Filling Games. [Citation Graph (, )][DBLP]
An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem [Citation Graph (, )][DBLP]
The Complexity of Flood Filling Games [Citation Graph (, )][DBLP]
Permuted Common Supersequence [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
|