6 research outputs found

    Finishing the euchromatic sequence of the human genome

    Get PDF
    The sequence of the human genome encodes the genetic instructions for human physiology, as well as rich information about human evolution. In 2001, the International Human Genome Sequencing Consortium reported a draft sequence of the euchromatic portion of the human genome. Since then, the international collaboration has worked to convert this draft into a genome sequence with high accuracy and nearly complete coverage. Here, we report the result of this finishing process. The current genome sequence (Build 35) contains 2.85 billion nucleotides interrupted by only 341 gaps. It covers ∌99% of the euchromatic genome and is accurate to an error rate of ∌1 event per 100,000 bases. Many of the remaining euchromatic gaps are associated with segmental duplications and will require focused work with new methods. The near-complete sequence, the first for a vertebrate, greatly improves the precision of biological analyses of the human genome including studies of gene number, birth and death. Notably, the human enome seems to encode only 20,000-25,000 protein-coding genes. The genome sequence reported here should serve as a firm foundation for biomedical research in the decades ahead

    Almost minimax design of FIR filter using an IRLS algorithm without matrix inversion

    No full text
    An iterative reweighted least squares (IRLS) algorithm is presented in this paper for the minimax design of FIR filters. In the algorithm, the resulted subproblems generated by the weighted least squares (WLS) are solved by using the conjugate gradient (CG) method instead of the time-consuming matrix inversion method. An almost minimax solution for filter design is consequently obtained. This solution is found to be very efficient compared with most existing algorithms. Moreover, the filtering solution is flexible enough for extension towards a broad range of filter designs, including constrained filters. Two design examples are given and the comparison with other existing algorithms shows the excellent performance of the proposed algorithm.Published versio
    corecore