Daniel G. Brown

Affiliations:
  • University of Waterloo, David R. Cheriton School of Computer Science, ON, Canada


According to our database1, Daniel G. Brown authored at least 63 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Study on Large Language Models' Limitations in Multiple-Choice Question Answering.
CoRR, 2024

2023
Reliability Check: An Analysis of GPT-3's Response to Sensitive Topics and Prompt Wording.
CoRR, 2023

Bits of Grass: Does GPT already know how to write like Whitman?
CoRR, 2023

2022
Crowd Score: A Method for the Evaluation of Jokes using Large Language Model AI Voters as Judges.
CoRR, 2022

2021
Computational Creativity and Aesthetics with Algorithmic Information Theory.
Entropy, 2021

On the Problem of Small Objects.
Entropy, 2021

Incorporating Algorithmic Information Theory into Fundamental Concepts of Computational Creativity.
Proceedings of the Twelfth International Conference on Computational Creativity, 2021

Are Machine Learning Corpora "Fair Dealing" under Canadian Law?
Proceedings of the Twelfth International Conference on Computational Creativity, 2021

2019
TwitSong 3.0: Towards Semantic Revisions in Computational Poetry.
Proceedings of the Tenth International Conference on Computational Creativity, 2019

2018
Evaluating Computational Creativity: An Interdisciplinary Tutorial.
ACM Comput. Surv., 2018

2017
Incorporating novelty, meaning, reaction and craft into computational poetry: a negative experimental result.
Proceedings of the Eighth International Conference on Computational Creativity, 2017

2016
Evaluating digital poetry: Insights from the CAT.
Proceedings of the Seventh International Conference on Computational Creativity, 2016

2015
Pollux: platform independent error correction of single and mixed genomes.
BMC Bioinform., 2015

Human Competence in Creativity Evaluation.
Proceedings of the Sixth International Conference on Computational Creativity, 2015

2014
Effects of rooting via out-groups on in-group topology in phylogeny.
Int. J. Bioinform. Res. Appl., 2014

Are Poetry and Lyrics All That Different?
Proceedings of the 15th International Society for Music Information Retrieval Conference, 2014

On Cultural, Textual and Experiential Aspects of Music Mood.
Proceedings of the 15th International Society for Music Information Retrieval Conference, 2014

2013
Fast error-tolerant quartet phylogeny algorithms.
Theor. Comput. Sci., 2013

Fast half-sibling population reconstruction: theory and algorithms.
Algorithms Mol. Biol., 2013

LSHPlace: Fast Phylogenetic Placement Using Locality-Sensitive Hashing.
Proceedings of the Biocomputing 2013: Proceedings of the Pacific Symposium, 2013

2012
PANDAseq: paired-end assembler for illumina sequences.
BMC Bioinform., 2012

Towards a practical O(n log n) phylogeny algorithm.
Algorithms Mol. Biol., 2012

Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

SibJoin: A Fast Heuristic for Half-Sibling Reconstruction.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

BLAST for Audio Sequences Alignment: A Fast Scalable Cover Identification Tool.
Proceedings of the 13th International Society for Music Information Retrieval Conference, 2012

Effects of rooting via outgroups on ingroup topology in phylogeny.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

2011
FEAST: Sensitive Local Alignment with Multiple Rates of Evolution.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Fast reconstruction of phylogenetic trees using locally-sensitive hashing
CoRR, 2011

More accurate recombination prediction in HIV-1 using a robust decoding algorithm for HMMs.
BMC Bioinform., 2011

Towards a Practical O(n logn) Phylogeny Algorithm.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

Invited: Fast and theoretically strong algorithms for kinship discovery.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

2010
New decoding algorithms for Hidden Markov Models using distance measures on labellings.
BMC Bioinform., 2010

Decoding HMMs using the <i>k </i>best paths: algorithms and applications.
BMC Bioinform., 2010

Discovering Kinship through Small Subsets.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Solving Misheard Lyric Search Queries Using a Probabilistic Model of Speech Sounds.
Proceedings of the 11th International Society for Music Information Retrieval Conference, 2010

2009
A Tutorial of Techniques for Improving Standard Hidden Markov Model Algorithms.
J. Bioinform. Comput. Biol., 2009

Automatic Detection of Internal and Imperfect Rhymes in Rap Lyrics.
Proceedings of the 10th International Society for Music Information Retrieval Conference, 2009

Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding.
Proceedings of the Bioinformatics and Computational Biology, 2009

2008
On the Structure of Small Motif Recognition Instances.
Proceedings of the String Processing and Information Retrieval, 2008

2007
The most probable annotation problem in HMMs and its application to bioinformatics.
J. Comput. Syst. Sci., 2007

A Graph Clustering Approach to Weak Motif Recognition.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Integer Programming Approaches to Haplotype Inference by Pure Parsimony.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Optimizing Multiple Spaced Seeds for Homology Search.
J. Comput. Biol., 2006

The Use of Functional Domains to Improve Transmembrane Protein Topology Prediction.
J. Bioinform. Comput. Biol., 2006

New Bounds for Motif Finding in Strong Instances.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Optimizing Multiple Seeds for Protein Homology Search.
IEEE ACM Trans. Comput. Biol. Bioinform., 2005

Vector seeds: An extension to spaced seeds.
J. Comput. Syst. Sci., 2005

Ancestral sequence alignment under optimal conditions.
BMC Bioinform., 2005

ExonHunter: a comprehensive approach to gene finding.
Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
A Tutorial of Recent Developments in the Seeding of Local Alignment.
J. Bioinform. Comput. Biol., 2004

Optimal Spaced Seeds for Homologous Coding Regions.
J. Bioinform. Comput. Biol., 2004

New Algorithms for Multiple DNA Sequence Alignment.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

A New Integer Programming Formulation for the Pure Parsimony Problem in Haplotype Analysis.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Multiple Vector Seeds for Protein Alignment.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

The Most Probable Labeling Problem in HMMs and Its Application to Bioinformatics.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

2003
Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specifity.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2001
A probabilistic analysis of a greedy algorithm arising from computational biology.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Algorithmic Methods in Genetic Mapping.
PhD thesis, 2000

Selective mapping: a discrete optimization approach to selecting a population subset for use in a high-density genetic mapping project.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000


  Loading...