2008 |
80 | EE | Christophe Dessimoz,
Daniel Margadant,
Gaston H. Gonnet:
DLIGHT - Lateral Gene Transfer Detection Using Pairwise Evolutionary Distances in a Statistical Framework.
RECOMB 2008: 315-330 |
2007 |
79 | EE | Adrian Schneider,
Christophe Dessimoz,
Gaston H. Gonnet:
OMA Browser - Exploring orthologous relations across 352 complete genomes.
Bioinformatics 23(16): 2180-2182 (2007) |
78 | EE | Adrian Schneider,
Gaston H. Gonnet,
Gina Cannarozzi:
SynPAM-A Distance Measure Based on Synonymous Codon Substitutions.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 553-560 (2007) |
2006 |
77 | EE | Adrian Schneider,
Gaston H. Gonnet,
Gina Cannarozzi:
Synonymous Codon Substitution Matrices.
International Conference on Computational Science (2) 2006: 630-637 |
76 | EE | Markus T. Friberg,
Pedro Gonnet,
Yves Barral,
Nicol N. Schraudolph,
Gaston H. Gonnet:
Measures of Codon Bias in Yeast, the tRNA Pairing Index and Possible DNA Repair Mechanisms.
WABI 2006: 1-11 |
2005 |
75 | EE | Christophe Dessimoz,
Gina Cannarozzi,
Manuel Gil,
Daniel Margadant,
Alexander Roth,
Adrian Schneider,
Gaston H. Gonnet:
OMA, A Comprehensive, Automated Project for the Identification of Orthologs from Complete Genome Data: Introduction and First Achievements.
Comparative Genomics 2005: 61-72 |
74 | EE | Adrian Schneider,
Gina Cannarozzi,
Gaston H. Gonnet:
Empirical codon substitution matrix.
BMC Bioinformatics 6: 134 (2005) |
73 | EE | Markus T. Friberg,
Peter von Rohr,
Gaston H. Gonnet:
Scoring functions for transcription factor binding site prediction.
BMC Bioinformatics 6: 84 (2005) |
72 | EE | Manuel Gil,
Christophe Dessimoz,
Gaston H. Gonnet:
A Dimensionless Fit Measure for Phylogenetic Distance Trees.
J. Bioinformatics and Computational Biology 3(6): 1429-1440 (2005) |
2004 |
71 | | Gaston H. Gonnet:
The tPI (tRNA Pairing Index), a Mathematical Measure of Repetition in a (Biological) Sequence.
IFIP TCS 2004: 1-2 |
70 | EE | Gaston H. Gonnet:
Some string matching problems from Bioinformatics which still need better solutions.
J. Discrete Algorithms 2(1): 3-15 (2004) |
2003 |
69 | | Bruno Buchberger,
Gaston H. Gonnet,
Michiel Hazewinkel:
Preface.
Ann. Math. Artif. Intell. 38(1-3): 1-2 (2003) |
2002 |
68 | EE | Gaston H. Gonnet:
String Matching Problems from Bioinformatics Which Still Need Better Solutions (Extended Abstract).
SPIRE 2002: 27-30 |
2000 |
67 | | Gaston H. Gonnet,
Daniel Panario,
Alfredo Viola:
LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings
Springer 2000 |
66 | | Gaston H. Gonnet,
Michael T. Hallett,
Chantal Korostensky,
Laurent Bernardin:
Darwin v. 2.0: an interpreted computer language for the biosciences.
Bioinformatics 16(2): 101-103 (2000) |
65 | | Chantal Korostensky,
Gaston H. Gonnet:
Using traveling salesman problem algorithms for evolutionary tree construction.
Bioinformatics 16(7): 619-627 (2000) |
64 | | Gaston H. Gonnet,
Chantal Korostensky,
Steven A. Benner:
Evaluation Measures of Multiple Sequence Alignments.
Journal of Computational Biology 7(1-2): 261-276 (2000) |
1999 |
63 | EE | Chantal Korostensky,
Gaston H. Gonnet:
Near Optimal Multiple Sequence Alignments Using a Traveling Salesman Problem Approach.
SPIRE/CRIWG 1999: 105-114 |
62 | EE | Ricardo A. Baeza-Yates,
Gaston H. Gonnet:
A Fast Algorithm on Average for All-Against-All Sequence Matching.
SPIRE/CRIWG 1999: 16-23 |
1997 |
61 | | Gareth Chelvanayagam,
Lukas Knecht,
Thomas Jenny,
Steven A. Benner,
Gaston H. Gonnet:
Structure Prediction with Combinatorial Distance Constraints.
German Conference on Bioinformatics 1997: 131 |
1996 |
60 | | Gaston H. Gonnet,
Steven A. Benner:
Probabilistic Ancestral Sequences and Multiple Alignments.
SWAT 1996: 380-391 |
59 | EE | Robert M. Corless,
Gaston H. Gonnet,
D. E. G. Hare,
David J. Jeffrey,
Donald E. Knuth:
On the LambertW function.
Adv. Comput. Math. 5(1): 329-359 (1996) |
58 | EE | Ricardo A. Baeza-Yates,
Gaston H. Gonnet:
Fast Text Searching for Regular Expressions or Automaton Searching on Tries.
J. ACM 43(6): 915-936 (1996) |
1994 |
57 | | Gaston H. Gonnet:
Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value (Abstract).
ESA 1994: 10-11 |
56 | EE | Michael B. Monagan,
Gaston H. Gonnet:
Signature Functions for Algebraic Numbers.
ISSAC 1994: 291-296 |
55 | EE | Gaston H. Gonnet:
Tutorial: Text Dominated Databases, Theory Practice and Experience.
PODS 1994: 301-302 |
54 | | Ricardo A. Baeza-Yates,
Christian Choffrut,
Gaston H. Gonnet:
On Boyer-Moore Automata.
Algorithmica 12(4/5): 268-292 (1994) |
53 | | Ricardo A. Baeza-Yates,
Gaston H. Gonnet:
Fast String Matching with Mismatches
Inf. Comput. 108(2): 187-199 (1994) |
1993 |
52 | | Philippe Flajolet,
Gaston H. Gonnet,
Claude Puech,
J. M. Robson:
Analytic Variations on Quadtrees.
Algorithmica 10(6): 473-500 (1993) |
1992 |
51 | | Trudy Weibel,
Gaston H. Gonnet:
An Assume Facility for CAS, with a Sample Implementation for Maple.
DISCO 1992: 95-103 |
50 | | Gaston H. Gonnet:
Efficient Two-dimensional Searching.
SWAT 1992: 317 |
49 | | Gaston H. Gonnet,
Ricardo A. Baeza-Yates,
Tim Snider:
New Indices for Text: Pat Trees and Pat Arrays.
Information Retrieval: Data Structures & Algorithms 1992: 66-82 |
48 | | Ricardo A. Baeza-Yates,
Gaston H. Gonnet,
Nivio Ziviani:
Improved Bounds for the Expected Behaviour of AVL Trees.
BIT 32(2): 297-315 (1992) |
47 | | Ricardo A. Baeza-Yates,
Gaston H. Gonnet:
A New Approach to Text Searching.
Commun. ACM 35(10): 74-82 (1992) |
46 | | Frank G. Garvan,
Gaston H. Gonnet:
A Proof for the Two Parameter Q-Cases of the Macdonald-Morris Constant Term Root System Conjecture for S(F4) and S(F4) via Zeilberger's Method.
J. Symb. Comput. 14(2/3): 141-178 (1992) |
1991 |
45 | EE | Trudy Weibel,
Gaston H. Gonnet:
An Algebra of Properties.
ISSAC 1991: 352-359 |
44 | | Philippe Flajolet,
Gaston H. Gonnet,
Claude Puech,
J. M. Robson:
The Analysis of Multidimensional Searching in Quad-Trees.
SODA 1991: 100-109 |
43 | | Walter Cunto,
Gaston H. Gonnet,
J. Ian Munro,
Patricio V. Poblete:
Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm
Inf. Comput. 92(2): 141-160 (1991) |
1990 |
42 | | Ricardo A. Baeza-Yates,
Gaston H. Gonnet:
Average Case Analysis of Algorithms using Matrix Recurrences.
ICCI 1990: 110-119 |
41 | | Ricardo A. Baeza-Yates,
Gaston H. Gonnet,
Mireille Régnier:
Analysis of Boyer-Moore-Type String Searching Algorithms.
SODA 1990: 328-343 |
40 | | Ricardo A. Baeza-Yates,
Gaston H. Gonnet,
Nivio Ziviani:
Expected Behaviour Analysis of AVL Trees.
SWAT 1990: 143-159 |
39 | | Gaston H. Gonnet,
Ricardo A. Baeza-Yates:
An Analysis of the Karp-Rabin String Matching Algorithm.
Inf. Process. Lett. 34(5): 271-274 (1990) |
1989 |
38 | | Ricardo A. Baeza-Yates,
Gaston H. Gonnet:
Efficient Text Searching of Regular Expressions (Extended Abstract).
ICALP 1989: 46-62 |
37 | EE | Ricardo A. Baeza-Yates,
Gaston H. Gonnet:
A New Approach to Text Searching.
SIGIR 1989: 168-175 |
36 | | Ricardo A. Baeza-Yates,
Gaston H. Gonnet:
Efficient Text Searching of Regular Expressions.
WADS 1989: 1-2 |
35 | | Bruce W. Char,
Keith O. Geddes,
Gaston H. Gonnet:
GCDHEU: Heuristic Polynomial GCD Algorithm Based On Integer GCD Computation.
J. Symb. Comput. 7(1): 31-48 (1989) |
34 | EE | Ricardo A. Baeza-Yates,
Gaston H. Gonnet:
A New Approach to Text Searching (correction).
SIGIR Forum 23(3-4): 7 (1989) |
1988 |
33 | | Keith O. Geddes,
Gaston H. Gonnet,
Trevor J. Smedley:
Heuristic Methods for Operations With Algebraic Numbers. (Extended Abstract)
ISSAC 1988: 475-480 |
32 | | Keith O. Geddes,
Gaston H. Gonnet:
A New Algorithm for Computing Symbolic Limits Using Hierarchical Series.
ISSAC 1988: 490-495 |
31 | EE | Gaston H. Gonnet,
Per-Åke Larson:
External hashing with limited internal storage.
J. ACM 35(1): 161-184 (1988) |
1987 |
30 | EE | Gaston H. Gonnet,
Frank Wm. Tompa:
Mind Your Grammar: a New Approach to Modelling Text.
VLDB 1987: 339-346 |
29 | | Ernest J. H. Chang,
Gaston H. Gonnet,
Doron Rotem:
On the Costs of Self-Stabilization.
Inf. Process. Lett. 24(5): 311-316 (1987) |
1986 |
28 | | Bruce W. Char,
Gregory J. Fee,
Keith O. Geddes,
Gaston H. Gonnet,
Michael B. Monagan:
A Tutorial Introduction to Maple.
J. Symb. Comput. 2(2): 179-200 (1986) |
27 | | Gaston H. Gonnet,
J. Ian Munro:
Heaps on Heaps.
SIAM J. Comput. 15(4): 964-971 (1986) |
1985 |
26 | | Nivio Ziviani,
Henk J. Olivié,
Gaston H. Gonnet:
The Analysis of an Inproved Symmetric Binary B-Tree Algorithm.
Comput. J. 28(4): 417-425 (1985) |
1984 |
25 | | Bruce W. Char,
Keith O. Geddes,
Gaston H. Gonnet:
GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation.
EUROSAM 1984: 285-296 |
24 | | Gaston H. Gonnet:
Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract)
STOC 1984: 334-341 |
23 | | Gaston H. Gonnet,
J. Ian Munro:
The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform.
J. Algorithms 5(4): 451-470 (1984) |
1983 |
22 | | Bruce W. Char,
Keith O. Geddes,
W. Morven Gentleman,
Gaston H. Gonnet:
The design of maple: A compact, portable and powerful computer algebra system.
EUROCAL 1983: 101-115 |
21 | EE | Gaston H. Gonnet:
Unstructured Data Bases or Very Efficient Text Searching.
PODS 1983: 117-124 |
20 | | Gaston H. Gonnet,
Frank Wm. Tompa:
A Constructive Approach to the Design of Algorithms and Their Data Structures.
Commun. ACM 26(11): 912-920 (1983) |
19 | | Gaston H. Gonnet:
Balancing Binary Trees by Internal Path Reduction.
Commun. ACM 26(12): 1074-1081 (1983) |
18 | | Gaston H. Gonnet,
Henk J. Olivié,
Derick Wood:
Height-Ratio-Balanced Trees.
Comput. J. 26(2): 106-108 (1983) |
17 | EE | Gaston H. Gonnet,
J. Ian Munro,
Derick Wood:
Direct dynamic structures for some line segment problems.
Computer Vision, Graphics, and Image Processing 23(2): 178-186 (1983) |
1982 |
16 | | Gaston H. Gonnet,
J. Ian Munro:
Heaps on Heaps.
ICALP 1982: 282-291 |
15 | EE | Gaston H. Gonnet,
Per-Åke Larson:
External Hashing with Limited Internal Storage.
PODS 1982: 256-261 |
14 | EE | Gaston H. Gonnet,
Per-Åke Larson,
J. Ian Munro,
Doron Rotem,
David J. Taylor,
Frank Wm. Tompa:
Database Storage Structures Research at the University of Waterloo.
IEEE Database Eng. Bull. 5(1): 49-52 (1982) |
13 | | Bernhard Eisenbarth,
Nivio Ziviani,
Gaston H. Gonnet,
Kurt Mehlhorn,
Derick Wood:
The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
Information and Control 55(1-3): 125-174 (1982) |
1981 |
12 | | Gaston H. Gonnet,
J. Ian Munro:
A Linear Probing Sort and its Analysis (Preliminary Draft)
STOC 1981: 90-95 |
11 | EE | Gaston H. Gonnet:
Expected Length of the Longest Probe Sequence in Hash Code Searching.
J. ACM 28(2): 289-304 (1981) |
10 | | Gaston H. Gonnet,
J. Ian Munro,
Hendra Suwanda:
Exegesis of Self-Organizing Linear Search.
SIAM J. Comput. 10(3): 613-637 (1981) |
1980 |
9 | | Gaston H. Gonnet,
Lawrence D. Rogers,
J. Alan George:
An Algorithmic and Complexity Analysis of Interpolation Search.
Acta Inf. 13: 39-52 (1980) |
8 | | Gaston H. Gonnet:
Open-Addressing Hashing with Unequal-Probability Keys.
J. Comput. Syst. Sci. 21(3): 354-367 (1980) |
1979 |
7 | | Gaston H. Gonnet,
J. Ian Munro,
Hendra Suwanda:
Toward Self-Organizing Linear Search (Preliminary Draught)
FOCS 1979: 169-174 |
6 | | Gaston H. Gonnet,
David E. Morgan:
Analysis of Closed Queuing Networks with Periodic Servers.
IEEE Trans. Software Eng. 5(6): 653-659 (1979) |
5 | | Gaston H. Gonnet,
J. Ian Munro:
Efficient Ordering of Hash Tables.
SIAM J. Comput. 8(3): 463-478 (1979) |
1978 |
4 | | Gaston H. Gonnet:
Notes on the Derivation of Asymptotic Expressions from Summations.
Inf. Process. Lett. 7(4): 165-169 (1978) |
1977 |
3 | | Gaston H. Gonnet,
J. Ian Munro:
The Analysis of an Improved Hashing Technique
STOC 1977: 113-121 |
2 | | Gaston H. Gonnet,
Lawrence D. Rogers:
The Interpolation-Sequential Search Algorithm.
Inf. Process. Lett. 6(4): 136-139 (1977) |
1976 |
1 | | Gaston H. Gonnet:
Heaps Applied to Event Driven Mechanisms.
Commun. ACM 19(7): 417-418 (1976) |