Concepedia
Discrete Applied Mathematics · 2009 · 41 citations · 5 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationComputational ComplexityGraph AlgorithmsGraph TheoryStructural ComplexityForbidden PatternsHamiltonian PathsPath Enumeration
5
A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry
Ting Chen, Ming‐Yang Kao, Matthew Tepel et al. · Journal of Computational Biology · 2001 · 250 citations
Life Sciences, Bioinformatics, Mass Spectrometric Analysis +14
On Two Problems in the Generation of Program Test Paths
Harold N. Gabow, Sachin Maheshwari, Leon J. Osterweil · IEEE Transactions on Software Engineering · 1976 · 196 citations
Computing, Computer Science, Algorithms +10
Finding paths and deleting edges in directed acyclic graphs
Giuseppe F. Italiano · Information Processing Letters · 1988 · 106 citations
On paths avoiding forbidden pairs of vertices in a graph
Hananya Yinnone · Discrete Applied Mathematics · 1997 · 26 citations
Natural Sciences, Mathematics, Combinatorics +6
Impossible pair constrained test path generation in a program
Pradip K. Srimani, Bhabani P. Sinha · Information Sciences · 1982 · 17 citations
Computing, Computer Science, Algorithms +7