Ming Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ming Zhang has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Anne-Kathrin Schultz
Department of Bioinformatics, Institute of Microbiology and Genetics, Georg August University, Göttingen, Germany
2 shared publications - Bette Korber
Los Alamos National Laboratory, Los Alamos, NM 87545, USA
2 shared publications - Burkhard Morgenstern
University of Göttingen, Institute of Microbiology and Genetics, Department of Bioinformatics, Goldschmidtstr. 1, 37077 Göttingen, Germany
2 shared publications - Thomas Leitner
Affiliation Theoretical Biology and Biophysics Group, Los Alamos National Laboratory, Los Alamos, New Mexico, United States of America
2 shared publications - Alexander Grossmann
Laboratoire Statistique et Génome, UMR 8071, Tour Evry 2, 523 Place des Terrasses, 91034 Evry, France
1 shared publication - Brian Thomas Foley
Theoretical Biology and Biophysics Group, Los Alamos National Laboratory , Los Alamos, NM 87545
1 shared publication
Latest Publications
- Open Access
- 27 May 2010
- Published by Springer Nature in Genome Biology
- Vol. 11 (5) , R56
Evidence for natural antisense transcript-mediated inhibition of microRNA function
Background: MicroRNAs (miRNAs) have the potential to regulate diverse sets of mRNA targets. In addition, mammalian genomes contain numerous natural antisense transcripts, most of which appear to be non-protein-coding RNAs (ncRNAs). We have recently identified and characterized a highly conserved non-coding antisense transcript for beta-secretase-1 (BACE1), a critical enzyme in Alzheimer's disease pathophysiology. The BACE1-antisense transcript is markedly up-regulated in brain samples from Alzheimer's disease patients and promotes the stability of the (sense) BACE1 transcript. Results: We report here that BACE1-antisense prevents miRNA-induced repression of BACE1 mRNA by masking the binding site for miR-485-5p. Indeed, miR-485-5p and BACE1-antisense compete for binding within the same region in the open reading frame of the BACE1 mRNA. We observed opposing effects of BACE1-antisense and miR-485-5p on BACE1 protein in vitro and showed that Locked Nucleic Acid-antimiR mediated knockdown of miR-485-5p as well as BACE1-antisense over-expression can prevent the miRNA-induced BACE1 suppression. We found that the expression of BACE1-antisense as well as miR-485-5p are dysregulated in RNA samples from Alzheimer's disease subjects compared to control individuals. Conclusions: Our data demonstrate an interface between two distinct groups of regulatory RNAs in the computation of BACE1 gene expression. Moreover, bioinformatics analyses revealed a theoretical basis for many other potential interactions between natural antisense transcripts and miRNAs at the binding sites of the latter.
- 27 May 2010
- Published by Springer Nature in Genome Biology
- Vol. 11 (5) , R56
Open AccessEvidence for natural antisense transcript-mediated inhibition of microRNA function
Background: MicroRNAs (miRNAs) have the potential to regulate diverse sets of mRNA targets. In addition, mammalian genomes contain numerous natural antisense transcripts, most of which appear to be non-protein-coding RNAs (ncRNAs). We have recently identified and characterized a highly conserved non-coding antisense transcript for beta-secretase-1 (BACE1), a critical enzyme in Alzheimer's disease pathophysiology. The BACE1-antisense transcript is markedly up-regulated in brain samples from Alzheimer's disease patients and promotes the stability of the (sense) BACE1 transcript. Results: We report here that BACE1-antisense prevents miRNA-induced repression of BACE1 mRNA by masking the binding site for miR-485-5p. Indeed, miR-485-5p and BACE1-antisense compete for binding within the same region in the open reading frame of the BACE1 mRNA. We observed opposing effects of BACE1-antisense and miR-485-5p on BACE1 protein in vitro and showed that Locked Nucleic Acid-antimiR mediated knockdown of miR-485-5p as well as BACE1-antisense over-expression can prevent the miRNA-induced BACE1 suppression. We found that the expression of BACE1-antisense as well as miR-485-5p are dysregulated in RNA samples from Alzheimer's disease subjects compared to control individuals. Conclusions: Our data demonstrate an interface between two distinct groups of regulatory RNAs in the computation of BACE1 gene expression. Moreover, bioinformatics analyses revealed a theoretical basis for many other potential interactions between natural antisense transcripts and miRNAs at the binding sites of the latter.
- Open Access
- 23 March 2010
- Published by Springer Nature in Retrovirology
- Vol. 7 (1) , 25
The role of recombination in the emergence of a complex and dynamic HIV epidemic
Inter-subtype recombinants dominate the HIV epidemics in three geographical regions. To better understand the role of HIV recombinants in shaping the current HIV epidemic, we here present the results of a large-scale subtyping analysis of 9435 HIV-1 sequences that involve subtypes A, B, C, G, F and the epidemiologically important recombinants derived from three continents.
- 23 March 2010
- Published by Springer Nature in Retrovirology
- Vol. 7 (1) , 25
Open AccessThe role of recombination in the emergence of a complex and dynamic HIV epidemic
Inter-subtype recombinants dominate the HIV epidemics in three geographical regions. To better understand the role of HIV recombinants in shaping the current HIV epidemic, we here present the results of a large-scale subtyping analysis of 9435 HIV-1 sequences that involve subtypes A, B, C, G, F and the epidemiologically important recombinants derived from three continents.
- Top Cited PapersOpen Access
- 2 January 2007
- Published by Springer Nature in BMC Bioinformatics
- Vol. 8 (1) , 1
Comparing sequences without using alignments: application to HIV/SIV subtyping
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for instance ambiguous regions) are deleted before tree building. To overcome this difficulty, one of us previously introduced a new and rapid algorithm that calculates dissimilarity matrices between sequences without preliminary alignment. Results: In this paper, HIV (Human Immunodeficiency Virus) and SIV (Simian Immunodeficiency Virus) sequence data are used to evaluate this method. The program produces tree topologies that are identical to those obtained by a combination of standard methods detailed in the HIV Sequence Compendium. Manual alignment editing is not necessary at any stage. Furthermore, only one user-specified parameter is needed for constructing trees. Conclusion: The extensive tests on HIV/SIV subtyping showed that the virus classifications produced by our method are in good agreement with our best taxonomic knowledge, even in non-coding LTR (Long Terminal Repeat) regions that are not tractable by regular alignment methods due to frequent duplications/insertions/deletions. Our method, however, is not limited to the HIV/SIV subtyping. It provides an alternative tree construction without a time-consuming aligning procedure.
- 2 January 2007
- Published by Springer Nature in BMC Bioinformatics
- Vol. 8 (1) , 1
Top Cited PapersOpen AccessComparing sequences without using alignments: application to HIV/SIV subtyping
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for instance ambiguous regions) are deleted before tree building. To overcome this difficulty, one of us previously introduced a new and rapid algorithm that calculates dissimilarity matrices between sequences without preliminary alignment. Results: In this paper, HIV (Human Immunodeficiency Virus) and SIV (Simian Immunodeficiency Virus) sequence data are used to evaluate this method. The program produces tree topologies that are identical to those obtained by a combination of standard methods detailed in the HIV Sequence Compendium. Manual alignment editing is not necessary at any stage. Furthermore, only one user-specified parameter is needed for constructing trees. Conclusion: The extensive tests on HIV/SIV subtyping showed that the virus classifications produced by our method are in good agreement with our best taxonomic knowledge, even in non-coding LTR (Long Terminal Repeat) regions that are not tractable by regular alignment methods due to frequent duplications/insertions/deletions. Our method, however, is not limited to the HIV/SIV subtyping. It provides an alternative tree construction without a time-consuming aligning procedure.
- Open Access
- 22 May 2006
- Published by Springer Nature in BMC Bioinformatics
- Vol. 7 (1) , 265
A jumping profile Hidden Markov Model and applications to recombination sites in HIV and HCV genomes
Background: Jumping alignments have recently been proposed as a strategy to search a given multiple sequence alignment A against a database. Instead of comparing a database sequence S to the multiple alignment or profile as a whole, S is compared and aligned to individual sequences from A. Within this alignment, S can jump between different sequences from A, so different parts of S can be aligned to different sequences from the input multiple alignment. This approach is particularly useful for dealing with recombination events. Results: We developed a jumping profile Hidden Markov Model (jpHMM), a probabilistic generalization of the jumping-alignment approach. Given a partition of the aligned input sequence family into known sequence subtypes, our model can jump between states corresponding to these different subtypes, depending on which subtype is locally most similar to a database sequence. Jumps between different subtypes are indicative of intersubtype recombinations. We applied our method to a large set of genome sequences from human immunodeficiency virus (HIV) and hepatitis C virus (HCV) as well as to simulated recombined genome sequences. Conclusion: Our results demonstrate that jumps in our jumping profile HMM often correspond to recombination breakpoints; our approach can therefore be used to detect recombinations in genomic sequences. The recombination breakpoints identified by jpHMM were found to be significantly more accurate than breakpoints defined by traditional methods based on comparing single representative sequences.
- 22 May 2006
- Published by Springer Nature in BMC Bioinformatics
- Vol. 7 (1) , 265
Open AccessA jumping profile Hidden Markov Model and applications to recombination sites in HIV and HCV genomes
Background: Jumping alignments have recently been proposed as a strategy to search a given multiple sequence alignment A against a database. Instead of comparing a database sequence S to the multiple alignment or profile as a whole, S is compared and aligned to individual sequences from A. Within this alignment, S can jump between different sequences from A, so different parts of S can be aligned to different sequences from the input multiple alignment. This approach is particularly useful for dealing with recombination events. Results: We developed a jumping profile Hidden Markov Model (jpHMM), a probabilistic generalization of the jumping-alignment approach. Given a partition of the aligned input sequence family into known sequence subtypes, our model can jump between states corresponding to these different subtypes, depending on which subtype is locally most similar to a database sequence. Jumps between different subtypes are indicative of intersubtype recombinations. We applied our method to a large set of genome sequences from human immunodeficiency virus (HIV) and hepatitis C virus (HCV) as well as to simulated recombined genome sequences. Conclusion: Our results demonstrate that jumps in our jumping profile HMM often correspond to recombination breakpoints; our approach can therefore be used to detect recombinations in genomic sequences. The recombination breakpoints identified by jpHMM were found to be significantly more accurate than breakpoints defined by traditional methods based on comparing single representative sequences.