Conrad J. Burden

Orcid: 0000-0003-0015-319X

According to our database1, Conrad J. Burden authored at least 15 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Computing expected moments of the Rényi parking problem on the circle.
CoRR, 2023

2019
Population Genetics.
Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 2, 2019

2015
Estimation of the methylation pattern distribution from deep sequencing data.
BMC Bioinform., 2015

Can Evolutionary Rate Matrices be Estimated from Allele Frequencies?.
Proceedings of the BIOINFORMATICS 2015, 2015

2014
The Distribution of Word Matches Between Markovian Sequences with Periodic Boundary Conditions.
J. Comput. Biol., 2014

2013
Word Match Counts Between Markovian Biological Sequences.
Proceedings of the Biomedical Engineering Systems and Technologies, 2013

The Distribution of Short Word Match Counts between Markovian Sequences.
Proceedings of the BIOINFORMATICS 2013 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Barcelona, Spain, 11, 2013

2010
Washing scaling of GeneChip microarray expression.
BMC Bioinform., 2010

Multiple gene expression profile alignment for microarray time-series data clustering.
Bioinform., 2010

New approaches to clustering microarray time-series data using multiple expression profile alignment.
Proceedings of the 2010 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2010

2009
Empirical distribution of k.
Pattern Recognit., 2009

Microarray Time-Series Data Clustering via Multiple Alignment of Gene Expression Profiles.
Proceedings of the Pattern Recognition in Bioinformatics, 2009

Intensity isotherms and distributions on oligonucleotide microarrays.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

2006
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences.
BMC Bioinform., 2006

Modelling Gene Regulatory Networks Using Galerkin Techniques Based on State Space Aggregation and Sparse Grids.
Proceedings of the Modeling, 2006


  Loading...