Daniel G. Brown

Daniel Gregory Brown

University of Waterloo

other persons with the same name:

• Daniel G. Brown
• Daniel G. Brown 0002 - University of Michigan, Ann Arbor

	2013
j17		Daniel G. Brown, Jakub Truszkowski: Fast error-tolerant quartet phylogeny algorithms. Theor. Comput. Sci. 483: 104-114 (2013)
	2012
j16		Jakub Truszkowski, Yanqi Hao, Daniel G. Brown: Towards a practical O(n log n) phylogeny algorithm. Algorithms for Molecular Biology 7: 32 (2012)
j15		Andre P. Masella, Andrea K. Bartram, Jakub Truszkowski, Daniel Gregory Brown, Josh D. Neufeld: PANDAseq: paired-end assembler for illumina sequences. BMC Bioinformatics 13: 31 (2012)
c27		Benjamin Martin, Daniel G. Brown, Pierre Hanna, Pascal Ferraro: BLAST for Audio Sequences Alignment: A Fast Scalable Cover Identification Tool. ISMIR 2012: 529-534
c26		Daniel Gregory Brown, Jakub Truszkowski: Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing. WABI 2012: 14-29
c25		Daniel Gregory Brown, Daniel Dexter: SibJoin: A Fast Heuristic for Half-Sibling Reconstruction. WABI 2012: 44-56
	2011
j14		Jakub Truszkowski, Daniel Gregory Brown: More accurate recombination prediction in HIV-1 using a robust decoding algorithm for HMMs. BMC Bioinformatics 12: 168 (2011)
j13		Alexander K. Hudek, Daniel Gregory Brown: FEAST: Sensitive Local Alignment with Multiple Rates of Evolution. IEEE/ACM Trans. Comput. Biology Bioinform. 8(3): 698-709 (2011)
c24		Daniel Gregory Brown, Jakub Truszkowski: Fast Error-Tolerant Quartet Phylogeny Algorithms. CPM 2011: 147-161
c23		Daniel G. Brown: Invited: Fast and theoretically strong algorithms for kinship discovery. ICCABS 2011: 5
c22		Daniel G. Brown, Jakub Truszkowski: Towards a Practical O(n logn) Phylogeny Algorithm. WABI 2011: 14-25
i2		Daniel G. Brown, Jakub Truszkowski: Fast reconstruction of phylogenetic trees using locally-sensitive hashing. CoRR abs/1111.0379 (2011)
	2010
j12		Daniel G. Brown, Daniil Golod: Decoding HMMs using the k best paths: algorithms and applications. BMC Bioinformatics 11(S-1): 28 (2010)
j11		Daniel G. Brown, Jakub Truszkowski: New decoding algorithms for Hidden Markov Models using distance measures on labellings. BMC Bioinformatics 11(S-1): 40 (2010)
c21		Hussein Hirjee, Daniel G. Brown: Solving Misheard Lyric Search Queries Using a Probabilistic Model of Speech Sounds. ISMIR 2010: 147-152
c20		Daniel G. Brown, Tanya Y. Berger-Wolf: Discovering Kinship through Small Subsets. WABI 2010: 111-123
i1		Daniel Gregory Brown, Jakub Truszkowski: Fast error-tolerant quartet phylogeny algorithms. CoRR abs/1010.1866 (2010)
	2009
j10		Daniil Golod, Daniel G. Brown: A Tutorial of Techniques for Improving Standard Hidden Markov Model Algorithms. J. Bioinformatics and Computational Biology 7(4): 737-754 (2009)
c19		Christina Boucher, Daniel G. Brown: Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding. BICoB 2009: 139-150
c18		Hussein Hirjee, Daniel G. Brown: Automatic Detection of Internal and Imperfect Rhymes in Rap Lyrics. ISMIR 2009: 711-716
	2008
c17		Christina Boucher, Daniel G. Brown, Stephane Durocher: On the Structure of Small Motif Recognition Instances. SPIRE 2008: 269-281
	2007
j9		Brona Brejová, Daniel G. Brown, Tomás Vinar: The most probable annotation problem in HMMs and its application to bioinformatics. J. Comput. Syst. Sci. 73(7): 1060-1077 (2007)
c16		Dan Gusfield, Yelena Frid, Daniel G. Brown: Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data. COCOON 2007: 51-64
c15		Christina Boucher, Daniel G. Brown, Paul Church: A Graph Clustering Approach to Weak Motif Recognition. WABI 2007: 149-160
	2006
j8		Emily W. Xu, Paul Kearney, Daniel G. Brown: The Use of Functional Domains to Improve Transmembrane Protein Topology Prediction. J. Bioinformatics and Computational Biology 4(1): 109-124 (2006)
j7		Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma: Optimizing Multiple Spaced Seeds for Homology Search. Journal of Computational Biology 13(7): 1355-1368 (2006)
j6		Daniel G. Brown, Ian M. Harrower: Integer Programming Approaches to Haplotype Inference by Pure Parsimony. IEEE/ACM Trans. Comput. Biology Bioinform. 3(2): 141-154 (2006)
c14		Brona Brejová, Daniel G. Brown, Ian M. Harrower, Tomás Vinar: New Bounds for Motif Finding in Strong Instances. CPM 2006: 94-105
	2005
j5		Alexander K. Hudek, Daniel G. Brown: Ancestral sequence alignment under optimal conditions. BMC Bioinformatics 6: 273 (2005)
j4		Brona Brejová, Daniel G. Brown, Tomás Vinar: Vector seeds: An extension to spaced seeds. J. Comput. Syst. Sci. 70(3): 364-380 (2005)
j3		Daniel G. Brown: Optimizing Multiple Seeds for Protein Homology Search. IEEE/ACM Trans. Comput. Biology Bioinform. 2(1): 29-38 (2005)
c13		Emily W. Xu, Daniel G. Brown, Paul Kearney: The use of functional domains to improve transmembrane protein topology prediction. APBC 2005: 105-116
c12		Brona Brejová, Daniel G. Brown, Ian M. Harrower, Alejandro López-Ortiz, Tomás Vinar: Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. CPM 2005: 1-10
c11		Brona Brejová, Daniel G. Brown, Ming Li, Tomás Vinar: ExonHunter: a comprehensive approach to gene finding. ISMB (Supplement of Bioinformatics) 2005: 57-65
	2004
j2		Brona Brejová, Daniel G. Brown, Tomás Vinar: Optimal Spaced Seeds for Homologous Coding Regions. J. Bioinformatics and Computational Biology 1(4): 595-610 (2004)
j1		Daniel G. Brown, Ming Li, Bin Ma: A Tutorial of Recent Developments in the Seeding of Local Alignment. J. Bioinformatics and Computational Biology 2(4): 819-842 (2004)
c10		Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma: Optimizing Multiple Spaced Seeds for Homology Search. CPM 2004: 47-58
c9		Daniel G. Brown: Multiple Vector Seeds for Protein Alignment. WABI 2004: 170-181
c8		Daniel G. Brown, Ian M. Harrower: A New Integer Programming Formulation for the Pure Parsimony Problem in Haplotype Analysis. WABI 2004: 254-265
c7		Daniel G. Brown, Alexander K. Hudek: New Algorithms for Multiple DNA Sequence Alignment. WABI 2004: 314-325
c6		Brona Brejová, Daniel G. Brown, Tomás Vinar: The Most Probable Labeling Problem in HMMs and Its Application to Bioinformatics. WABI 2004: 426-437
	2003
c5		Brona Brejová, Daniel G. Brown, Tomás Vinar: Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions. CPM 2003: 42-54
c4		Brona Brejová, Daniel G. Brown, Tomás Vinar: Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specifity. WABI 2003: 39-54
c3		Brona Brejová, Daniel G. Brown, Tomás Vinar: Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency. WABI 2003: 78-94
	2001
c2		Daniel G. Brown: A probabilistic analysis of a greedy algorithm arising from computational biology. SODA 2001: 206-207
	2000
c1		Daniel G. Brown, Todd J. Vision, Steven D. Tanksley: Selective mapping: a discrete optimization approach to selecting a population subset for use in a high-density genetic mapping project. SODA 2000: 419-428

Coauthor Index

Colors in the list of coauthors

Last update Thu May 23 16:19:42 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page