Computing and Information Systems - Research Publications

Permanent URI for this collection

Search Results

Now showing 1 - 7 of 7
  • Item
  • Item
    Thumbnail Image
    Reference-Free Validation of Short Read Data
    Schroeder, J ; Bailey, J ; Conway, T ; Zobel, J ; Aramayo, R (PUBLIC LIBRARY SCIENCE, 2010-09-22)
    BACKGROUND: High-throughput DNA sequencing techniques offer the ability to rapidly and cheaply sequence material such as whole genomes. However, the short-read data produced by these techniques can be biased or compromised at several stages in the sequencing process; the sources and properties of some of these biases are not always known. Accurate assessment of bias is required for experimental quality control, genome assembly, and interpretation of coverage results. An additional challenge is that, for new genomes or material from an unidentified source, there may be no reference available against which the reads can be checked. RESULTS: We propose analytical methods for identifying biases in a collection of short reads, without recourse to a reference. These, in conjunction with existing approaches, comprise a methodology that can be used to quantify the quality of a set of reads. Our methods involve use of three different measures: analysis of base calls; analysis of k-mers; and analysis of distributions of k-mers. We apply our methodology to wide range of short read data and show that, surprisingly, strong biases appear to be present. These include gross overrepresentation of some poly-base sequences, per-position biases towards some bases, and apparent preferences for some starting positions over others. CONCLUSIONS: The existence of biases in short read data is known, but they appear to be greater and more diverse than identified in previous literature. Statistical analysis of a set of short reads can help identify issues prior to assembly or resequencing, and should help guide chemical or statistical methods for bias rectification.
  • Item
    Thumbnail Image
    Classifying proteins using gapped Markov feature pairs
    Ji, X ; Bailey, J ; Ramamohanarao, K (ELSEVIER, 2010-08)
  • Item
    Thumbnail Image
    A binary decision diagram based approach for mining frequent subsequences
    Loekito, E ; Bailey, J ; Pei, J (SPRINGER LONDON LTD, 2010-08)
  • Item
  • Item
    Thumbnail Image
    Enhancing the B+-tree by dynamic node popularity caching
    Yu, C ; Bailey, J ; Montefusco, J ; Zhang, R ; Zhong, J (ELSEVIER SCIENCE BV, 2010-03-01)
  • Item
    Thumbnail Image
    Efficient incremental mining of contrast patterns in changing data
    Bailey, J ; Loekito, E (ELSEVIER, 2010-01-01)