SPEQ: quality assessment of peptide tandem mass spectra with deep learning | 0 | 0.34 | 2022 |
Adjacent Y-ion Ratio Distributions and Its Application in Peptide Sequencing. | 0 | 0.34 | 2019 |
An Improved Approach for N-linked Glycan Structure Identification from HCD MS/MS Spectra. | 1 | 0.36 | 2019 |
Designing and Implementing Algorithms for the Closest String Problem. | 0 | 0.34 | 2017 |
An Approach for Peptide Identification by De Novo Sequencing of Mixture Spectra | 0 | 0.34 | 2017 |
Randomized Fixed-Parameter Algorithms for the Closest String Problem | 1 | 0.39 | 2016 |
An Approach for Matching Mixture MS/MS Spectra with a Pair of Peptide Sequences in a Protein Database. | 0 | 0.34 | 2015 |
A Novel Algorithm for Glycan de novo Sequencing Using Tandem Mass Spectrometry. | 1 | 0.36 | 2015 |
An Effective Algorithm for Peptide de novo Sequencing from Mixture MS/MS Spectra. | 1 | 0.48 | 2014 |
Optimizing Spaced -mer Neighbors for Efficient Filtration in Protein Similarity Search | 0 | 0.34 | 2014 |
A combinatorial approach to the peptide feature matching problem for label-free quantification. | 2 | 0.38 | 2013 |
De novo sequencing with limited number of post-translational modifications per peptide. | 1 | 0.45 | 2013 |
Efficient filtration for similarity search with spaced k-mer neighbors | 0 | 0.34 | 2012 |
A three-string approach to the closest string problem | 11 | 0.53 | 2012 |
Closest string with outliers. | 11 | 0.39 | 2011 |
Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction | 4 | 0.44 | 2011 |
On the Longest Common Rigid Subsequence Problem | 2 | 0.36 | 2010 |
Better score function for peptide identification with ETD MS/MS spectra. | 9 | 0.62 | 2010 |
Ancient Chinese zither (guqin) music recovery with support vector machine | 1 | 0.37 | 2010 |
ZOOM Lite: next-generation sequencing data mapping and visualization software. | 1 | 0.34 | 2010 |
Why Greed Works for Shortest Common Superstring Problem | 4 | 0.44 | 2009 |
Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design | 4 | 0.43 | 2009 |
Automated protein (re)sequencing with MS/MS and a homologous database yields almost full coverage and accuracy. | 5 | 0.54 | 2009 |
Challenges in Computational Analysis of Mass Spectrometry Data for Proteomics | 7 | 0.79 | 2009 |
Amino Acid Classification and Hash Seeds for Homology Search | 2 | 0.38 | 2009 |
More efficient algorithms for closest string and substring problems | 38 | 1.10 | 2009 |
On the similarity metric and the distance metric | 23 | 1.12 | 2009 |
PAS: Predicate-Based Authentication Services Against Powerful Passive Adversaries | 20 | 0.83 | 2008 |
Rainbow Network Flow of Multiple Description Codes | 16 | 1.05 | 2008 |
Information shared by many objects | 11 | 0.73 | 2008 |
A new quartet approach for reconstructing phylogenetic trees: quartet joining method | 1 | 0.58 | 2008 |
Complexities and Algorithms for Glycan Structure Sequencing using Tandem Mass Spectrometry | 1 | 0.37 | 2007 |
Rapid Homology Search with Neighbor Seeds | 6 | 0.48 | 2007 |
Mobility Limited Flip-Based Sensor Networks Deployment | 26 | 1.49 | 2007 |
The Normalized Similarity Metric and Its Applications | 1 | 0.41 | 2007 |
On the complexity of the spaced seeds | 18 | 0.81 | 2007 |
Near optimal multiple alignment within a band in polynomial time | 3 | 0.46 | 2007 |
A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method | 1 | 0.58 | 2007 |
Deploying Wireless Sensor Networks under Limited Mobility Constraints | 40 | 1.97 | 2007 |
Optimizing Multiple Spaced Seeds for Homology Search | 39 | 2.00 | 2006 |
Superiority and complexity of the spaced seeds | 19 | 0.77 | 2006 |
An effective algorithm for peptide de novo sequencing from MS/MS spectra | 22 | 1.95 | 2005 |
Sensor networks deployment using flip-based sensors | 31 | 1.68 | 2005 |
An automata approach to match gapped sequence tags against protein database | 0 | 0.34 | 2005 |
SPIDER: software for protein identification from sequence tags with de novo sequencing error. | 25 | 2.11 | 2005 |
Rapid homology search with two-stage extension and daughter seeds | 3 | 0.41 | 2005 |
tPatternHunter: gapped, fast and sensitive translated homology search. | 13 | 0.73 | 2005 |
On the longest common rigid subsequence problem | 6 | 0.52 | 2005 |
On spaced seeds for similarity search | 74 | 3.73 | 2004 |
The longest common subsequence problem for arc-annotated sequences | 40 | 1.89 | 2004 |