Volume 10 Supplement 1

Selected papers from the Seventh Asia-Pacific Bioinformatics Conference (APBC 2009)


Edited by Michael Q Zhang, Michael S Waterman and Xuegong Zhang

The Seventh Asia Pacific Bioinformatics Conference (APBC 2009). Go to conference site.

Beijing, China

13-16 January 2009

Previous Page Page 1 of 4 Next Page
  1. Research

    Genome aliquoting with double cut and join

    The genome aliquoting probem is, given an observed genome A with n copies of each gene, presumed to descend from an n-way polyploidization event from an ordinary diploid genome B, followed by a history of chromos...

    Robert Warren and David Sankoff

    BMC Bioinformatics 2009 10(Suppl 1):S2

    Published on: 30 January 2009

  2. Research

    Maximum independent sets of commuting and noninterfering inversions

    Given three signed permutations, an inversion median is a fourth permutation that minimizes the sum of the pairwise inversion distances between it and the three others. This problem is NP-hard as well as hard ...

    Krister M Swenson, Yokuki To, Jijun Tang and Bernard ME Moret

    BMC Bioinformatics 2009 10(Suppl 1):S6

    Published on: 30 January 2009

  3. Research

    Inversion-based genomic signatures

    Reconstructing complete ancestral genomes (at least in terms of their gene inventory and arrangement) is attracting much interest due to the rapidly increasing availability of whole genome sequences. While mod...

    Krister M Swenson and Bernard ME Moret

    BMC Bioinformatics 2009 10(Suppl 1):S7

    Published on: 30 January 2009

  4. Research

    Triplet supertree heuristics for the tree of life

    There is much interest in developing fast and accurate supertree methods to infer the tree of life. Supertree methods combine smaller input trees with overlapping sets of taxa to make a comprehensive phylogene...

    Harris T Lin, J Gordon Burleigh and Oliver Eulenstein

    BMC Bioinformatics 2009 10(Suppl 1):S8

    Published on: 30 January 2009

  5. Research

    Improved algorithms for approximate string matching (extended abstract)

    The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorith...

    Dimitris Papamichail and Georgios Papamichail

    BMC Bioinformatics 2009 10(Suppl 1):S10

    Published on: 30 January 2009

  6. Research

    Simultaneous phylogeny reconstruction and multiple sequence alignment

    A phylogeny is the evolutionary history of a group of organisms. To date, sequence data is still the most used data type for phylogenetic reconstruction. Before any sequences can be used for phylogeny reconstr...

    Feng Yue, Jian Shi and Jijun Tang

    BMC Bioinformatics 2009 10(Suppl 1):S11

    Published on: 30 January 2009

  7. Research

    Methods for comparative metagenomics

    Metagenomics is a rapidly growing field of research that aims at studying uncultured organisms to understand the true diversity of microbes, their functions, cooperation and evolution, in environments such as ...

    Daniel H Huson, Daniel C Richter, Suparna Mitra, Alexander F Auch and Stephan C Schuster

    BMC Bioinformatics 2009 10(Suppl 1):S12

    Published on: 30 January 2009

  8. Research

    DNA motif alignment by evolving a population of Markov chains

    Deciphering cis-regulatory elements or de novo motif-finding in genomes still remains elusive although much algorithmic effort has been expended. The Markov chain Monte Carlo (MCMC) method such as Gibbs motif sam...

    Chengpeng Bi

    BMC Bioinformatics 2009 10(Suppl 1):S13

    Published on: 30 January 2009

  9. Research

    Parallel short sequence assembly of transcriptomes

    The de novo assembly of genomes and transcriptomes from short sequences is a challenging problem. Because of the high coverage needed to assemble short sequences as well as the overhead of modeling the assembly p...

    Benjamin G Jackson, Patrick S Schnable and Srinivas Aluru

    BMC Bioinformatics 2009 10(Suppl 1):S14

    Published on: 30 January 2009

  10. Research

    Finding optimal threshold for correction error reads in DNA assembling

    DNA assembling is the problem of determining the nucleotide sequence of a genome from its substrings, called reads. In the experiments, there may be some errors on the reads which affect the performance of the DN...

    Francis YL Chin, Henry CM Leung, Wei-Lin Li and Siu-Ming Yiu

    BMC Bioinformatics 2009 10(Suppl 1):S15

    Published on: 30 January 2009

  11. Research

    Crystallizing short-read assemblies around seeds

    New short-read sequencing technologies produce enormous volumes of 25–30 base paired-end reads. The resulting reads have vastly different characteristics than produced by Sanger sequencing, and require differe...

    Mohammad Sajjad Hossain, Navid Azimi and Steven Skiena

    BMC Bioinformatics 2009 10(Suppl 1):S16

    Published on: 30 January 2009

  12. Research

    Short read DNA fragment anchoring algorithm

    The emerging next-generation sequencing method based on PCR technology boosts genome sequencing speed considerably, the expense is also get decreased. It has been utilized to address a broad range of bioinform...

    Wendi Wang, Peiheng Zhang and Xinchun Liu

    BMC Bioinformatics 2009 10(Suppl 1):S17

    Published on: 30 January 2009

  13. Research

    A voting approach to identify a small number of highly predictive genes using multiple classifiers

    Microarray gene expression profiling has provided extensive datasets that can describe characteristics of cancer patients. An important challenge for this type of data is the discovery of gene sets which can b...

    Md Rafiul Hassan, M Maruf Hossain, James Bailey, Geoff Macintyre, Joshua WK Ho and Kotagiri Ramamohanarao

    BMC Bioinformatics 2009 10(Suppl 1):S19

    Published on: 30 January 2009

  14. Research

    Knowledge driven decomposition of tumor expression profiles

    Tumors have been hypothesized to be the result of a mixture of oncogenic events, some of which will be reflected in the gene expression of the tumor. Based on this hypothesis a variety of data-driven methods h...

    Martin H van Vliet, Lodewyk FA Wessels and Marcel JT Reinders

    BMC Bioinformatics 2009 10(Suppl 1):S20

    Published on: 30 January 2009

Previous Page Page 1 of 4 Next Page