Gaston H. Gonnet

According to our database1, Gaston H. Gonnet
  • authored at least 96 papers between 1976 and 2015.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2015
The OMA orthology database in 2015: function predictions, better plant support, synteny view and other improvements.
Nucleic Acids Research, 2015

2012
Surprising results on phylogenetic tree building methods based on molecular sequences.
BMC Bioinformatics, 2012

2011
OMA 2011: orthology inference among 1000 complete genomes.
Nucleic Acids Research, 2011

2009
Algorithm of OMA for large-scale orthology inference.
BMC Bioinformatics, 2009

Mathematics and Computer Science Serving/Impacting Bioinformatics.
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008
Algorithm of OMA for large-scale orthology inference.
BMC Bioinformatics, 2008

DLIGHT - Lateral Gene Transfer Detection Using Pairwise Evolutionary Distances in a Statistical Framework.
Proceedings of the Research in Computational Molecular Biology, 2008

2007
SynPAM-A Distance Measure Based on Synonymous Codon Substitutions.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

A Phylogenomic Study of Human, Dog, and Mouse.
PLoS Computational Biology, 2007

OMA Browser - Exploring orthologous relations across 352 complete genomes.
Bioinformatics, 2007

2006
A Repetition Test for Pseudo-Random Number Generators.
Monte Carlo Meth. and Appl., 2006

Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences.
BMC Bioinformatics, 2006

Measures of Codon Bias in Yeast, the tRNA Pairing Index and Possible DNA Repair Mechanisms.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Synonymous Codon Substitution Matrices.
Proceedings of the Computational Science, 2006

2005
A Dimensionless Fit Measure for Phylogenetic Distance Trees.
J. Bioinformatics and Computational Biology, 2005

Empirical codon substitution matrix.
BMC Bioinformatics, 2005

Scoring functions for transcription factor binding site prediction.
BMC Bioinformatics, 2005

OMA, A Comprehensive, Automated Project for the Identification of Orthologs from Complete Genome Data: Introduction and First Achievements.
Proceedings of the Comparative Genomics, 2005

2004
Some string matching problems from Bioinformatics which still need better solutions.
J. Discrete Algorithms, 2004

The tPI (tRNA Pairing Index), a Mathematical Measure of Repetition in a (Biological) Sequence.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Preface.
Ann. Math. Artif. Intell., 2003

2002
String Matching Problems from Bioinformatics Which Still Need Better Solutions (Extended Abstract).
Proceedings of the String Processing and Information Retrieval, 2002

2000
Evaluation Measures of Multiple Sequence Alignments.
Journal of Computational Biology, 2000

Using traveling salesman problem algorithms for evolutionary tree construction.
Bioinformatics, 2000

Darwin v. 2.0: an interpreted computer language for the biosciences.
Bioinformatics, 2000

1999
Near Optimal Multiple Sequence Alignments Using a Traveling Salesman Problem Approach.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

A Fast Algorithm on Average for All-Against-All Sequence Matching.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

1997
Structure Prediction with Combinatorial Distance Constraints.
German Conference on Bioinformatics, 1997

1996
Fast Text Searching for Regular Expressions or Automaton Searching on Tries.
J. ACM, 1996

On the LambertW function.
Adv. Comput. Math., 1996

Probabilistic Ancestral Sequences and Multiple Alignments.
Proceedings of the Algorithm Theory, 1996

1994
Fast String Matching with Mismatches
Inf. Comput., February, 1994

On Boyer-Moore Automata.
Algorithmica, 1994

Tutorial: Text Dominated Databases, Theory Practice and Experience.
Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

Signature Functions for Algebraic Numbers.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value (Abstract).
Proceedings of the Algorithms, 1994

1993
Analytic Variations on Quadtrees.
Algorithmica, 1993

1992
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., 1992

A New Approach to Text Searching.
Commun. ACM, 1992

Improved Bounds for the Expected Behaviour of AVL Trees.
BIT, 1992

Efficient Two-dimensional Searching.
Proceedings of the Algorithm Theory, 1992

An Assume Facility for CAS, with a Sample Implementation for Maple.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1992

New Indices for Text: Pat Trees and Pat Arrays.
Information Retrieval: Data Structures & Algorithms, 1992

1991
Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm
Inf. Comput., June, 1991

The Analysis of Multidimensional Searching in Quad-Trees.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

An Algebra of Properties.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

Maple V - language reference manual.
Springer, ISBN: 978-0-387-97622-8, 1991

Maple V - library reference manual.
Springer, ISBN: 978-0-387-97592-4, 1991

1990
An Analysis of the Karp-Rabin String Matching Algorithm.
Inf. Process. Lett., 1990

Expected Behaviour Analysis of AVL Trees.
Proceedings of the SWAT 90, 1990

Analysis of Boyer-Moore-Type String Searching Algorithms.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Average Case Analysis of Algorithms using Matrix Recurrences.
Proceedings of the Advances in Computing and Information, 1990

1989
A New Approach to Text Searching (correction).
SIGIR Forum, 1989

GCDHEU: Heuristic Polynomial GCD Algorithm Based On Integer GCD Computation.
J. Symb. Comput., 1989

Efficient Text Searching of Regular Expressions.
Proceedings of the Algorithms and Data Structures, 1989

A New Approach to Text Searching.
Proceedings of the SIGIR'89, 1989

Efficient Text Searching of Regular Expressions (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988
External hashing with limited internal storage.
J. ACM, 1988

Examples of Maple applied to problems from the American Mathematical Monthly.
ACM SIGSAM Bulletin, 1988

Heuristic Methods for Operations With Algebraic Numbers. (Extended Abstract)
Proceedings of the Symbolic and Algebraic Computation, 1988

A New Algorithm for Computing Symbolic Limits Using Hierarchical Series.
Proceedings of the Symbolic and Algebraic Computation, 1988

1987
On the Costs of Self-Stabilization.
Inf. Process. Lett., 1987

Mind Your Grammar: a New Approach to Modelling Text.
Proceedings of the VLDB'87, 1987

1986
Heaps on Heaps.
SIAM J. Comput., 1986

A Tutorial Introduction to Maple.
J. Symb. Comput., 1986

An implementation of operators for symbolic algebra systems.
Proceedings of the SYMSAC 1986, 1986

New results for random determination of equivalence of expressions.
Proceedings of the SYMSAC 1986, 1986

Computer algebra in the undergraduate mathematics classroom.
Proceedings of the SYMSAC 1986, 1986

1985
The Analysis of an Inproved Symmetric Binary B-Tree Algorithm.
Comput. J., 1985

1984
The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform.
J. Algorithms, 1984

Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract)
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation.
Proceedings of the EUROSAM 84, 1984

1983
Direct dynamic structures for some line segment problems.
Computer Vision, Graphics, and Image Processing, 1983

Height-Ratio-Balanced Trees.
Comput. J., 1983

Solution of a general system of equations.
ACM SIGSAM Bulletin, 1983

The maple symbolic computation system.
ACM SIGSAM Bulletin, 1983

A Constructive Approach to the Design of Algorithms and Their Data Structures.
Commun. ACM, 1983

Balancing Binary Trees by Internal Path Reduction.
Commun. ACM, 1983

Unstructured Data Bases or Very Efficient Text Searching.
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

The design of maple: A compact, portable and powerful computer algebra system.
Proceedings of the Computer Algebra, 1983

1982
The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
Information and Control, 1982

Database Storage Structures Research at the University of Waterloo.
IEEE Database Eng. Bull., 1982

External Hashing with Limited Internal Storage.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982

Heaps on Heaps.
Proceedings of the Automata, 1982

1981
Exegesis of Self-Organizing Linear Search.
SIAM J. Comput., 1981

Expected Length of the Longest Probe Sequence in Hash Code Searching.
J. ACM, 1981

A Linear Probing Sort and its Analysis (Preliminary Draft)
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980
Open-Addressing Hashing with Unequal-Probability Keys.
J. Comput. Syst. Sci., 1980

An Algorithmic and Complexity Analysis of Interpolation Search.
Acta Inf., 1980

1979
Analysis of Closed Queuing Networks with Periodic Servers.
IEEE Trans. Software Eng., 1979

Efficient Ordering of Hash Tables.
SIAM J. Comput., 1979

Toward Self-Organizing Linear Search (Preliminary Draught)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
Notes on the Derivation of Asymptotic Expressions from Summations.
Inf. Process. Lett., 1978

1977
The Interpolation-Sequential Search Algorithm.
Inf. Process. Lett., 1977

The Analysis of an Improved Hashing Technique
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976
Heaps Applied to Event Driven Mechanisms.
Commun. ACM, 1976


  Loading...