论文信息 - Summary of Algorithmic Fragments For Statistical Identification of Markers From a Set of Spectral Courses

Summary of Algorithmic Fragments For Statistical Identification of Markers From a Set of Spectral Courses

A brief introduction of algorithms for the statistical identification of markers from a set of spectral courses is the topic of our paper. Partial results, demonstrated by pictures, are very promising. Therefore, our next effort will be directed at the construction of the 1st prototype of some semi-commercial software for the identification of markers from a set of spectral courses.

[1] B. Vojtesek,et al. Power Function for Tests of Null Hypotheses on Mutual Linear Regression Functions ’ Relations , 2007 .

[2] B. Vojtesek,et al. Identification of αB-Crystallin, a Biomarker of Renal Cell Carcinoma by SELDI-TOF MS , 2008 .

[3] Julien Langou,et al. Rounding error analysis of the classical Gram-Schmidt orthogonalization process , 2005, Numerische Mathematik.

[4] B. Vojtesek,et al. Test of the Hypothesis That One Group of Dependences is Consistent with Another Group of Dependences , 2008 .

[5] H. Gatignon. Statistical analysis of management data , 1996 .

[6] S. Sapra. Truncation and Unidentifiability: The Single Sample Case , 2008 .

[7] W. Arnoldi. The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .

[8] Nicholas J. Higham,et al. INVERSE PROBLEMS NEWSLETTER , 1991 .

[9] A. Ralston. A first course in numerical analysis , 1965 .

[10] Ladislav Beránek,et al. Using Markers to Aid Decision Making in Diagnostics , 2011 .

[11] G. Forsythe. Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer , 1957 .

[12] Jiri Knizek. Marker Statistics I. , 2011 .

[13] M. Rozložník,et al. The loss of orthogonality in the Gram-Schmidt orthogonalization process , 2005 .

[14] Nicholas J. Higham,et al. Accuracy and stability of numerical algorithms, Second Edition , 2002 .