Name
Affiliation
Papers
BIN MA
University of Western Ontario, London, Ontario, Canada
73
Collaborators
Citations 
PageRank 
79
1758
155.63
Referers 
Referees 
References 
2520
934
797
Search Limit
1001000
Title
Citations
PageRank
Year
SPEQ: quality assessment of peptide tandem mass spectra with deep learning00.342022
Adjacent Y-ion Ratio Distributions and Its Application in Peptide Sequencing.00.342019
An Improved Approach for N-linked Glycan Structure Identification from HCD MS/MS Spectra.10.362019
Designing and Implementing Algorithms for the Closest String Problem.00.342017
An Approach for Peptide Identification by De Novo Sequencing of Mixture Spectra00.342017
Randomized Fixed-Parameter Algorithms for the Closest String Problem10.392016
An Approach for Matching Mixture MS/MS Spectra with a Pair of Peptide Sequences in a Protein Database.00.342015
A Novel Algorithm for Glycan de novo Sequencing Using Tandem Mass Spectrometry.10.362015
An Effective Algorithm for Peptide de novo Sequencing from Mixture MS/MS Spectra.10.482014
Optimizing Spaced -mer Neighbors for Efficient Filtration in Protein Similarity Search00.342014
A combinatorial approach to the peptide feature matching problem for label-free quantification.20.382013
De novo sequencing with limited number of post-translational modifications per peptide.10.452013
Efficient filtration for similarity search with spaced k-mer neighbors00.342012
A three-string approach to the closest string problem110.532012
Closest string with outliers.110.392011
Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction40.442011
On the Longest Common Rigid Subsequence Problem20.362010
Better score function for peptide identification with ETD MS/MS spectra.90.622010
Ancient Chinese zither (guqin) music recovery with support vector machine10.372010
ZOOM Lite: next-generation sequencing data mapping and visualization software.10.342010
Why Greed Works for Shortest Common Superstring Problem40.442009
Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design40.432009
Automated protein (re)sequencing with MS/MS and a homologous database yields almost full coverage and accuracy.50.542009
Challenges in Computational Analysis of Mass Spectrometry Data for Proteomics70.792009
Amino Acid Classification and Hash Seeds for Homology Search20.382009
More efficient algorithms for closest string and substring problems381.102009
On the similarity metric and the distance metric231.122009
PAS: Predicate-Based Authentication Services Against Powerful Passive Adversaries200.832008
Rainbow Network Flow of Multiple Description Codes161.052008
Information shared by many objects110.732008
A new quartet approach for reconstructing phylogenetic trees: quartet joining method10.582008
Complexities and Algorithms for Glycan Structure Sequencing using Tandem Mass Spectrometry10.372007
Rapid Homology Search with Neighbor Seeds60.482007
Mobility Limited Flip-Based Sensor Networks Deployment261.492007
The Normalized Similarity Metric and Its Applications10.412007
On the complexity of the spaced seeds180.812007
Near optimal multiple alignment within a band in polynomial time30.462007
A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method10.582007
Deploying Wireless Sensor Networks under Limited Mobility Constraints401.972007
Optimizing Multiple Spaced Seeds for Homology Search392.002006
Superiority and complexity of the spaced seeds190.772006
An effective algorithm for peptide de novo sequencing from MS/MS spectra221.952005
Sensor networks deployment using flip-based sensors311.682005
An automata approach to match gapped sequence tags against protein database00.342005
SPIDER: software for protein identification from sequence tags with de novo sequencing error.252.112005
Rapid homology search with two-stage extension and daughter seeds30.412005
tPatternHunter: gapped, fast and sensitive translated homology search.130.732005
On the longest common rigid subsequence problem60.522005
On spaced seeds for similarity search743.732004
The longest common subsequence problem for arc-annotated sequences401.892004
  • 1
  • 2