Bin Ma
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
Bin Ma has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Kaizhong Zhang
Computer Science Department, University of Western Ontario, London, ON N6A 5B7, Canada
2 shared publications- Kaizhong Zhang
Department of Computer Science, University of Western Ontario, London, Canada
2 shared publications Ming Li
2 shared publicationsAmanda Doherty‐Kirby
Department of Biochemistry, University of Western Ontario, London, ON N6A 5C1, Canada
1 shared publicationChengzhi Liang
Bioinformatics Solutions Inc., Waterloo, ON N2L 3L2, Canada
1 shared publicationChristopher Hendrie
Bioinformatics Solutions Inc., Waterloo, ON N2L 3L2, Canada
1 shared publication
Latest Publications
- 22 April 2016
- Published by Springer Nature
- p. 1545-1547
Peptide De Novo Sequencing with MS/MS
- Open Access
- 6 August 2008
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 24 (21) , 2431-2437
ZOOM! Zillions of oligos mapped
Motivation: The next generation sequencing technologies are generating billions of short reads daily. Resequencing and personalized medicine need much faster software to map these deep sequencing reads to a reference genome, to identify SNPs or rare transcripts. Results: We present a framework for how full sensitivity mapping can be done in the most efficient way, via spaced seeds. Using the framework, we have developed software called ZOOM, which is able to map the Illumina/Solexa reads of 15× coverage of a human genome to the reference human genome in one CPU-day, allowing two mismatches, at full sensitivity. Availability: ZOOM is freely available to non-commercial users at http://www.bioinfor.com/zoom Contact:bma@csd.uwo.ca, mli@uwaterloo.ca
- 6 August 2008
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 24 (21) , 2431-2437
Open AccessZOOM! Zillions of oligos mapped
Motivation: The next generation sequencing technologies are generating billions of short reads daily. Resequencing and personalized medicine need much faster software to map these deep sequencing reads to a reference genome, to identify SNPs or rare transcripts. Results: We present a framework for how full sensitivity mapping can be done in the most efficient way, via spaced seeds. Using the framework, we have developed software called ZOOM, which is able to map the Illumina/Solexa reads of 15× coverage of a human genome to the reference human genome in one CPU-day, allowing two mismatches, at full sensitivity. Availability: ZOOM is freely available to non-commercial users at http://www.bioinfor.com/zoom Contact:bma@csd.uwo.ca, mli@uwaterloo.ca
- 7 March 2008
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 16 (3) , 293-306
A new quartet approach for reconstructing phylogenetic trees: quartet joining method
- 7 March 2008
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 16 (3) , 293-306
A new quartet approach for reconstructing phylogenetic trees: quartet joining method
- 4 March 2008
- Published by Springer Nature in Algorithmica
- Vol. 56 (2) , 270-280
On the Longest Common Rigid Subsequence Problem
- 4 March 2008
- Published by Springer Nature in Algorithmica
- Vol. 56 (2) , 270-280
On the Longest Common Rigid Subsequence Problem
- 8 May 2007
- Published by Springer Nature in Algorithmica
- Vol. 48 (2) , 187-202
Rapid Homology Search with Neighbor Seeds
- 8 May 2007
- Published by Springer Nature in Algorithmica
- Vol. 48 (2) , 187-202
Rapid Homology Search with Neighbor Seeds
- 1 June 2006
- Published by World Scientific Pub Co Pte Ltd in Journal of Bioinformatics and Computational Biology
- Vol. 04 (03) , 709-720
IMPROVING THE SENSITIVITY AND SPECIFICITY OF PROTEIN HOMOLOGY SEARCH BY INCORPORATING PREDICTED SECONDARY STRUCTURES
In this paper, we improve the homology search performance by the combination of the predicted protein secondary structures and protein sequences. Previous research suggested that the straightforward combination of predicted secondary structures did not improve the homology search performance, mostly because of the errors in the structure prediction. We solved this problem by taking into account the confidence scores output by the prediction programs.
- 1 June 2006
- Published by World Scientific Pub Co Pte Ltd in Journal of Bioinformatics and Computational Biology
- Vol. 04 (03) , 709-720
IMPROVING THE SENSITIVITY AND SPECIFICITY OF PROTEIN HOMOLOGY SEARCH BY INCORPORATING PREDICTED SECONDARY STRUCTURES
In this paper, we improve the homology search performance by the combination of the predicted protein secondary structures and protein sequences. Previous research suggested that the straightforward combination of predicted secondary structures did not improve the homology search performance, mostly because of the errors in the structure prediction. We solved this problem by taking into account the confidence scores output by the prediction programs.
- Open Access
- 16 September 2004
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (4) , 542-544
tPatternHunter: gapped, fast and sensitive translated homology search
Summary: New ideas, spaced seeds and gapped alignment before 6-frame translation are implemented for translated homology search in tPatternHunter. The new software compares favorably with tBLASTx. Availability: The software is free to academics at http://www.bioinformaticssolutions.com/downloads/ph-academic/ Contact:bma@csd.uwo.ca
- 16 September 2004
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (4) , 542-544
Open AccesstPatternHunter: gapped, fast and sensitive translated homology search
Summary: New ideas, spaced seeds and gapped alignment before 6-frame translation are implemented for translated homology search in tPatternHunter. The new software compares favorably with tBLASTx. Availability: The software is free to academics at http://www.bioinformaticssolutions.com/downloads/ph-academic/ Contact:bma@csd.uwo.ca
- Open Access
The similarity metric
A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of Kolmogorov complexity, and show that it is in this class and it minorizes every computable distance in the class (that is, it is universal in that it discovers all computable similarities). We demonstrate that it is a metric and call it the {\em similarity metric}. This theory forms the foundation for a new practical tool. To evidence generality and robustness we give two distinctive applications in widely divergent areas using standard compression programs like gzip and GenCompress. First, we compare whole mitochondrial genomes and infer their evolutionary history. This results in a first completely automatic computed whole mitochondrial phylogeny tree. Secondly, we fully automatically compute the language tree of 52 different languages.
Open AccessThe similarity metric
A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of Kolmogorov complexity, and show that it is in this class and it minorizes every computable distance in the class (that is, it is universal in that it discovers all computable similarities). We demonstrate that it is a metric and call it the {\em similarity metric}. This theory forms the foundation for a new practical tool. To evidence generality and robustness we give two distinctive applications in widely divergent areas using standard compression programs like gzip and GenCompress. First, we compare whole mitochondrial genomes and infer their evolutionary history. This results in a first completely automatic computed whole mitochondrial phylogeny tree. Secondly, we fully automatically compute the language tree of 52 different languages.
- Top Cited Papers
- 19 September 2003
- Published by Wiley in Rapid Communications in Mass Spectrometry
- Vol. 17 (20) , 2337-2342
PEAKS: powerful software for peptide de novo sequencing by tandem mass spectrometry
A number of different approaches have been described to identify proteins from tandem mass spectrometry (MS/MS) data. The most common approaches rely on the available databases to match experimental MS/MS data. These methods suffer from several drawbacks and cannot be used for the identification of proteins from unknown genomes. In this communication, we describe a new de novo sequencing software package, PEAKS, to extract amino acid sequence information without the use of databases. PEAKS uses a new model and a new algorithm to efficiently compute the best peptide sequences whose fragment ions can best interpret the peaks in the MS/MS spectrum. The output of the software gives amino acid sequences with confidence scores for the entire sequences, as well as an additional novel positional scoring scheme for portions of the sequences. The performance of PEAKS is compared with Lutefisk, a well‐known de novo sequencing software, using quadrupole‐time‐of‐flight (Q‐TOF) data obtained for several tryptic peptides from standard proteins. Copyright © 2003 John Wiley & Sons, Ltd.
- 19 September 2003
- Published by Wiley in Rapid Communications in Mass Spectrometry
- Vol. 17 (20) , 2337-2342
Top Cited PapersPEAKS: powerful software for peptide de novo sequencing by tandem mass spectrometry
A number of different approaches have been described to identify proteins from tandem mass spectrometry (MS/MS) data. The most common approaches rely on the available databases to match experimental MS/MS data. These methods suffer from several drawbacks and cannot be used for the identification of proteins from unknown genomes. In this communication, we describe a new de novo sequencing software package, PEAKS, to extract amino acid sequence information without the use of databases. PEAKS uses a new model and a new algorithm to efficiently compute the best peptide sequences whose fragment ions can best interpret the peaks in the MS/MS spectrum. The output of the software gives amino acid sequences with confidence scores for the entire sequences, as well as an additional novel positional scoring scheme for portions of the sequences. The performance of PEAKS is compared with Lutefisk, a well‐known de novo sequencing software, using quadrupole‐time‐of‐flight (Q‐TOF) data obtained for several tryptic peptides from standard proteins. Copyright © 2003 John Wiley & Sons, Ltd.