Two combinatorial optimization problems for SNP discovery using base-specific cleavage and mass spectrometry

BMC Systems Biology

Volumn 6, Issue SUPPL.2, 2012, Pages

  Chen, Xin ^a   Wu, Qiong ^a,b   Sun, Ruimin ^a   Zhang, Louxin ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b Ministry of Education   (China)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

ALGORITHM; ARTICLE; BIOLOGY; GENETICS; MASS SPECTROMETRY; METHODOLOGY; SINGLE NUCLEOTIDE POLYMORPHISM;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DNA; MASS SPECTROMETRY; POLYMORPHISM, SINGLE NUCLEOTIDE;

MLCS; MLOWN;

EID: 84878628050     PISSN: None     EISSN: 17520509     Source Type: Journal    
DOI: 10.1186/1752-0509-6-S2-S5     Document Type: Article

References (10)

1. Bocker S. SNP and mutation discovery using base-specific cleavage and MALDI-TOF mass spectrometry. Bioinformatics 2003, 19(Suppl 1):i44-53. 10.1093/bioinformatics/btg1004, 12855436.
2. Krebs S, Medugorac I, Seichter D, Forster M. RNaseCut: a MALDI mass spectrometry-based method for SNP discovery. Nucleic Acids Research 2003, 31(7). 152822, 12655025.
3. Stanssens P, Zabeau M, Meersseman G, Remes G, Gansemans Y, Storm N, Hartmer R, Honisch C, Rodi CP, Bocker S, van den Boom D. High-throughput MALDI-TOF discovery of genomic sequence polymorphisms. Genome Research 2004, 14:126-133. 314289, 14707174.
4. Hartmer R, Storm N, Bocker S, Rodi CP, Hillenkamp F, Jurinke C, van den Boom D. RNase T1 mediated base-specific cleavage and MALDI-TOF MS for high-throughput comparative sequence analysis. Nucleic Acids Research 2003, 31(9). 154235, 12711692.
5. Honisch C, Raghunathan A, Cantor CR, Palsson BO, van den Boom D. High-throughput mutation detection underlying adaptive evolution of Escherichia coli-K12. Genome Research 2004, 14(12):2495-2502. 10.1101/gr.2977704, 534674, 15574828.
6. RNaseCut webpage link. , http://www.vetmed.uni-muenchen.de/gen/forschung.html
7. Garey MR, Johnson DS. Complexity results for multiprocessor scheduling under resource constraints. Siam Journal on Computing 1975, 4:397-411.
8. Hulett H, Will TG, Woeginger GJ. Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. Operations Research Letters 2008, 36(5):594-596.
9. Bocker S. Sequencing from compomers: Using mass spectrometry for DNA de novo sequencing of 200+ nt. Journal of Computational Biology 2004, 11(6):1110-1134. 10.1089/cmb.2004.11.1110, 15662201.
10. Pevzner PA, Tang HX, Waterman MS. An Eulerian path approach to DNA fragment assembly. Proceedings of the National Academy of Sciences of the United States of America 2001, 98(17):9748-9753. 10.1073/pnas.171285098, 55524, 11504945.