2009 |
19 | EE | Raphaël Clifford,
Klim Efremenko,
Ely Porat,
Amir Rothschild:
From coding theory to efficient pattern matching.
SODA 2009: 778-784 |
2008 |
18 | EE | Raphaël Clifford,
Klim Efremenko,
Benny Porat,
Ely Porat:
A Black Box for Online Approximate Pattern Matching.
CPM 2008: 143-151 |
17 | EE | Raphaël Clifford,
Klim Efremenko,
Benny Porat,
Ely Porat,
Amir Rothschild:
Mismatch Sampling.
SPIRE 2008: 99-108 |
16 | EE | Benjamin Sach,
Raphaël Clifford:
An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem
CoRR abs/0802.1026: (2008) |
15 | EE | Michael A. Bender,
Raphaël Clifford,
Kostas Tsichlas:
Scheduling algorithms for procrastinators.
J. Scheduling 11(2): 95-104 (2008) |
2007 |
14 | EE | Peter Clifford,
Raphaël Clifford:
Self-normalised Distance with Don't Cares.
CPM 2007: 63-70 |
13 | EE | Raphaël Clifford,
Klim Efremenko,
Ely Porat,
Amir Rothschild:
k -Mismatch with Don't Cares.
ESA 2007: 151-162 |
12 | EE | Raphaël Clifford,
Benjamin Sach:
Fast Approximate Point Set Matching for Information Retrieval.
SOFSEM (1) 2007: 212-223 |
11 | EE | Raphaël Clifford,
Ely Porat:
A Filtering Algorithm for k -Mismatch with Don't Cares.
SPIRE 2007: 130-136 |
10 | EE | Peter Clifford,
Raphaël Clifford:
Simple deterministic wildcard matching.
Inf. Process. Lett. 101(2): 53-54 (2007) |
2006 |
9 | EE | Inbok Lee,
Raphaël Clifford,
Sung-Ryul Kim:
Algorithms on Extended (delta, gamma)-Matching.
ICCSA (3) 2006: 1137-1142 |
8 | | Raphaël Clifford,
Manolis Christodoulakis,
Tim Crawford,
David Meredith,
Geraint A. Wiggins:
A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval.
ISMIR 2006: 150-155 |
7 | EE | Michael A. Bender,
Raphaël Clifford,
Kostas Tsichlas:
Scheduling Algorithms for Procrastinators
CoRR abs/cs/0606067: (2006) |
2005 |
6 | EE | Peter Clifford,
Raphaël Clifford,
Costas S. Iliopoulos:
Faster Algorithms for delta, gamma-Matching and Related Problems.
CPM 2005: 68-78 |
5 | EE | Yoan José Pinzón Ardila,
Raphaël Clifford,
Manal Mohamed:
Necklace Swap Problem for Rhythmic Similarity Measures.
SPIRE 2005: 234-245 |
4 | EE | Raphaël Clifford:
Distributed suffix trees.
J. Discrete Algorithms 3(2-4): 176-197 (2005) |
2004 |
3 | EE | Raphaël Clifford,
Costas S. Iliopoulos:
Approximate string matching for music analysis.
Soft Comput. 8(9): 597-603 (2004) |
2003 |
2 | EE | Raphaël Clifford,
Marek J. Sergot:
Distributed and Paged Suffix Trees for Large Genetic Databases.
CPM 2003: 70-82 |
2000 |
1 | | Raphaël Clifford,
Aaron J. Mackey:
Disperse: a simple and efficient approach to parallel database searching.
Bioinformatics 16(6): 564-565 (2000) |