2008 | ||
---|---|---|
61 | EE | Adam L. Buchsbaum, Raffaele Giancarlo: Table Compression. Encyclopedia of Algorithms 2008 |
60 | EE | Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park: Two-Dimensional Pattern Indexing. Encyclopedia of Algorithms 2008 |
59 | EE | Alberto Apostolico, Raffaele Giancarlo: Periodicity and repetitions in parameterized strings. Discrete Applied Mathematics 156(9): 1389-1398 (2008) |
58 | EE | Raffaele Giancarlo, Sridhar Hannenhalli: Guest Editors' Introduction to the Special Section on Algorithms in Bioinformatics. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 482-483 (2008) |
57 | EE | Raffaele Giancarlo, Davide Scaturro, Filippo Utro: A Tutorial on Computational Cluster Analysis with Applications to Pattern Discovery in Microarray Data. Mathematics in Computer Science 1(4): 655-672 (2008) |
56 | EE | Raffaele Giancarlo, Stefano Lonardi: Foreword: Special issue in honor of the 60th Birthday of Professor Alberto Apostolico: Work is for people who do not know how to: SAIL - String Algorithms, Information and Learning. Theor. Comput. Sci. 395(2-3): 135-136 (2008) |
55 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Balázs Rácz: New results for finding common neighborhoods in massive graphs in the data stream model. Theor. Comput. Sci. 407(1-3): 302-309 (2008) |
2007 | ||
54 | Raffaele Giancarlo, Sridhar Hannenhalli: Algorithms in Bioinformatics, 7th International Workshop, WABI 2007, Philadelphia, PA, USA, September 8-9, 2007, Proceedings Springer 2007 | |
53 | EE | Joong Chae Na, Raffaele Giancarlo, Kunsoo Park: On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time. Algorithmica 48(2): 173-186 (2007) |
52 | EE | Raffaele Giancarlo, Antonio Restivo, Marinella Sciortino: From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization. Theor. Comput. Sci. 387(3): 236-248 (2007) |
2006 | ||
51 | EE | Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini: The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression. ESA 2006: 756-767 |
50 | EE | Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini: The Myriad Virtues of Wavelet Trees. ICALP (1) 2006: 560-571 |
2005 | ||
49 | EE | Joong Chae Na, Raffaele Giancarlo, Kunsoo Park: O(n2log n) Time On-Line Construction of Two-Dimensional Suffix Trees. COCOON 2005: 273-282 |
48 | EE | Vito Di Gesù, Raffaele Giancarlo, Giosuè Lo Bosco, Alessandra Raimondi, Davide Scaturro: GenClust: A genetic algorithm for clustering gene expression data. BMC Bioinformatics 6: 289 (2005) |
47 | EE | Alberto Apostolico, Raffaele Giancarlo: Periodicity and Repetitions in Parameterized Strings. Electronic Notes in Discrete Mathematics 21: 227-230 (2005) |
46 | EE | Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini, Marinella Sciortino: Boosting textual compression in optimal linear time. J. ACM 52(4): 688-713 (2005) |
45 | EE | Alberto Apostolico, Raffaele Giancarlo: Foreword: Pattern Discovery in the Post Genome. Theor. Comput. Sci. 335(1): 1-2 (2005) |
2004 | ||
44 | EE | Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot: Longest Motifs with a Functionally Equivalent Central Block. SPIRE 2004: 298-209 |
43 | EE | Raffaele Giancarlo, David Sankoff: Editorial: Combinatiorial Pattern Matching. J. Discrete Algorithms 2(2): 135-136 (2004) |
2003 | ||
42 | EE | Raffaele Giancarlo, Marinella Sciortino: Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms. CPM 2003: 129-143 |
41 | EE | Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo: Improving table compression with combinatorial optimization. J. ACM 50(6): 825-851 (2003) |
40 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook: On finding common neighborhoods in massive graphs. Theor. Comput. Sci. 1-3(299): 707-718 (2003) |
2002 | ||
39 | EE | Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo: Improving table compression with combinatorial optimization. SODA 2002: 213-222 |
38 | EE | Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo: Improving Table Compression with Combinatorial Optimization CoRR cs.DS/0203018: (2002) |
37 | EE | Brenda S. Baker, Raffaele Giancarlo: Sparse Dynamic Programming for Longest Common Subsequence from Fragments. J. Algorithms 42(2): 231-254 (2002) |
2001 | ||
36 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook: An Approximate Determinization Algorithm for Weighted Finite-State Automata. Algorithmica 30(4): 503-526 (2001) |
2000 | ||
35 | Raffaele Giancarlo, David Sankoff: Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings Springer 2000 | |
34 | EE | Adam L. Buchsbaum, Raffaele Giancarlo: Algorithmic Aspects of Speech Recognition: A Synopsis. CPM 2000: 27-32 |
33 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook: On the Determinization of Weighted Finite Automata. SIAM J. Comput. 30(5): 1502-1531 (2000) |
1999 | ||
32 | EE | Raffaele Giancarlo, Roberto Grossi: Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices. J. Complexity 15(1): 30-71 (1999) |
31 | EE | Raffaele Giancarlo, Daniela Guaiana: On-line Construction of Two-Dimensional Suffix Trees. J. Complexity 15(1): 72-127 (1999) |
1998 | ||
30 | EE | Brenda S. Baker, Raffaele Giancarlo: Longest Common Subsequence from Fragments via Sparse Dynamic Programming. ESA 1998: 79-90 |
29 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook: On the Determinization of Weighted Finite Automata. ICALP 1998: 482-493 |
28 | Alberto Apostolico, Raffaele Giancarlo: Seqeunce Alignment in Molecular Biology. Journal of Computational Biology 5(2): 173-196 (1998) | |
1997 | ||
27 | Raffaele Giancarlo, Daniela Guaiana: On-Line Construction of Two-Dimensional Suffix Trees. ESA 1997: 217-231 | |
26 | EE | Adam L. Buchsbaum, Raffaele Giancarlo: Algorithmic Aspects in Speech Recognition: An Introduction. ACM Journal of Experimental Algorithmics 2: 1 (1997) |
25 | Raffaele Giancarlo, Roberto Grossi: Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms. J. Algorithms 24(2): 223-265 (1997) | |
1996 | ||
24 | Raffaele Giancarlo, Roberto Grossi: On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. Inf. Comput. 130(2): 151-182 (1996) | |
1995 | ||
23 | Raffaele Giancarlo, Roberto Grossi: Multi-Dimensional Pattern Matching with Dimensional Wildcards. CPM 1995: 90-101 | |
22 | Raffaele Giancarlo, Roberto Grossi: On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. ICALP 1995: 111-122 | |
21 | Raffaele Giancarlo: A Generalization of the Suffix Tree to Square Matrices, with Applications. SIAM J. Comput. 24(3): 520-562 (1995) | |
1994 | ||
20 | Raffaele Giancarlo, Filippo Mignosi: Generalizations of the Periodicity Theorem of Fine and Wilf. CAAP 1994: 130-141 | |
19 | Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park: Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49(2): 208-222 (1994) | |
1993 | ||
18 | Raffaele Giancarlo: The Suffix of a Square Matrix, with Applications. SODA 1993: 402-411 | |
17 | EE | Raffaele Giancarlo, Roberto Grossi: Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices. SPAA 1993: 86-97 |
16 | Raffaele Giancarlo: An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching. WADS 1993: 337-348 | |
1992 | ||
15 | EE | David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano: Sparse Dynamic Programming I: Linear Cost Functions. J. ACM 39(3): 519-545 (1992) |
14 | EE | David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano: Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM 39(3): 546-567 (1992) |
13 | Zvi Galil, Raffaele Giancarlo: On the Exact Complexity of String Matching: Upper Bounds. SIAM J. Comput. 21(3): 407-437 (1992) | |
1991 | ||
12 | Zvi Galil, Raffaele Giancarlo: On the Exact Complexity of String Matching: Lower Bounds. SIAM J. Comput. 20(6): 1008-1020 (1991) | |
1990 | ||
11 | Livio Colussi, Zvi Galil, Raffaele Giancarlo: On the Exact Complexity of String Matching (Extended Abstract) FOCS 1990: 135-144 | |
10 | David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano: Sparse Dynamic Programming. SODA 1990: 513-522 | |
1989 | ||
9 | Zvi Galil, Raffaele Giancarlo: Speeding up Dynamic Programming with Applications to Molecular Biology. Theor. Comput. Sci. 64(1): 107-118 (1989) | |
1988 | ||
8 | David Eppstein, Zvi Galil, Raffaele Giancarlo: Speeding up Dynamic Programming FOCS 1988: 488-496 | |
7 | EE | Zvi Galil, Raffaele Giancarlo: Data structures and algorithms for approximate string matching. J. Complexity 4(1): 33-72 (1988) |
1987 | ||
6 | Wojciech Rytter, Raffaele Giancarlo: Optimal Parallel Parsing of Bracket Languages. Parallel Algorithms and Architectures 1987: 146-154 | |
5 | Zvi Galil, Raffaele Giancarlo: Parallel String Matching with k Mismatches. Theor. Comput. Sci. 51: 341-348 (1987) | |
4 | Wojciech Rytter, Raffaele Giancarlo: Optimal Parallel Parsing of Bracket Languages. Theor. Comput. Sci. 53: 295-306 (1987) | |
1986 | ||
3 | Renato M. Capocelli, Raffaele Giancarlo, Indeer Jet Taneja: Bounds on the redundancy of Huffman codes. IEEE Transactions on Information Theory 32(6): 854- (1986) | |
2 | Alberto Apostolico, Raffaele Giancarlo: The Boyer-Moore-Galil String Searching Strategies Revisited. SIAM J. Comput. 15(1): 98-105 (1986) | |
1984 | ||
1 | Alberto Apostolico, Raffaele Giancarlo: Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability. Inf. Process. Lett. 18(3): 155-158 (1984) |