MASSIS: A mass spectrum simulation system. 2: Procedures and performance

European Journal of Mass Spectrometry

Volumn 9, Issue 5, 2003, Pages 445-457

  Chen, HaiFeng ^a,b   Fan, BoTao ^a   Petitjean, Michel ^a   Panaye, Annick ^a   Doucet, Jean Pierre ^a   Li, Feng ^b   Xia, HaiRong ^b   Yuan, ShenGang ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b SHANGHAI INSTITUTE OF ORGANIC CHEMISTRY   (China)

Author keywords

Comparative study; Databases; Fragment intensity determination; Mass spectral simulation; Software; Ullmann algorithm

Indexed keywords

DATABASE SYSTEMS; MASS SPECTROMETRY; QUERY PROCESSING;

COMPARATIVE STUDIES; DEPTH FIRST SEARCH ALGORITHMS; FRAGMENT INTENSITY DETERMINATION; INTENSITY VALUES; MASS SPECTRAL; MCLAFFERTY REARRANGEMENT; RETRO DIELS-ALDER REACTIONS; SUBGRAPH ISOMORPHISM;

COMPUTER SOFTWARE;

ORGANIC COMPOUND; OXYGEN;

ALGORITHM; ARTICLE; ATOM; COMPARATIVE STUDY; COMPUTER PROGRAM; COMPUTER SIMULATION; COMPUTER SYSTEM; DATA BASE; DIELS ALDER REACTION; EVALUATION; MASS SPECTROMETRY; PERFORMANCE; REACTION ANALYSIS;

EID: 0346218198     PISSN: 14690667     EISSN: None     Source Type: Journal    
DOI: 10.1255/ejms.577     Document Type: Article

References (12)

1. H.F. Chen, B.T. Fan, H.R. Xia, M. Petitjean, S.G. Yuan, A. Panaye and J.P. Doucet "MASSIS: A Mass Spectra Simulation System 1. Principle and Method," Eur. J. Mass Spectrom. 9, 175 (2003).
2. M.R. Garey and D.S. Johnson, "Computers and Intractability. A Guide to the Theory of NP-Completeness (Appendix A1.4)", Ed by V. Klee. W.H. Freeman and Co., New York, USA (1979).
3. D.G. Corneil and C.C. Gotlieb, "An Efficient Algorithm for Graph Isomorphism," J. Assoc. Comput. Machin. 17, 51 (1970).
4. J.R. Ullmann, "An Algorithm for Subgraph Isomorphism," J. Assoc. Comput. Machin. 23, 31 (1976).
5. D.C. Schmidt and L.E. Druffel, "A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices," J. Assoc. Comput. Machin. 23, 433 (1976).
6. L.P. Cordella, P. Foggia, C. Sansone and M. Vento, "Evaluation Performance of the VF Graph Matching Algorithm,"in Proc. of the 10th International Conference on Image Analysis and Processing. IEEE Computer Society Press, pp. 1172-1177 (1999).
7. L.P. Cordella, P. Foggia, C. Sansone, F. Tortorella and M. Vento, "Graph Matching: A Fast Algorithm and its Evaluation" in Proc. of the 14th International Conference on Pattern Recognition, Brisbane, Australia, August, 16-20, pp. 1582-1584 (1998).
8. E. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik. 1, 269 (1959).
9. B.T. Fan, A. Panaye, J.P. Doucet and A. Barbu, "Ring perception: a new algorithm for finding directly the SSSR from connection table," J. Chem. Inf. Comput. Sci. 33, 657 (1993).
10. B.T. Fan, A. Barbu, A. Panaye, and J.P. Doucet, "Detection of constitutionally equivalent sites from a connection table," J. Chem. Inf. Comput. Sci. 36, 654 (1996).
11. R. Tarjan, "Depth-First Search and Linear graph Algorithms," SIAM J. Comput. 1, 146 (1972).
12. J. Gasteiger, W. Hanebeck and K.P. Schulz, "Prediction of Mass Spectra from Structural Information," J. Chem. Inf. Comput. Sci. 32, 264 (1992).