A private DNA motif finding algorithm

Journal of Biomedical Informatics

Volumn 50, Issue , 2014, Pages 122-132

  Chen, Rui ^a   Peng, Yun ^b   Choi, Byron ^a   Xu, Jianliang ^a   Hu, Haibo ^a  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Motif finding; N gram model; Privacy protection; small element of Differential privacy

Indexed keywords

ALGORITHMS; COMPUTER AIDED LANGUAGE TRANSLATION; DNA; GENES;

BACK-GROUND KNOWLEDGE; BIOLOGICAL APPLICATIONS; DIFFERENTIAL PRIVACIES; GENOMIC-SEQUENCE DATA; MOTIF FINDING; N-GRAM MODELING; PRIVACY MODELS; PRIVACY PROTECTION;

BIOINFORMATICS;

DNA;

ARTICLE; DNA DETERMINATION; DNA MOTIF; DNA SEQUENCE; DNA STRUCTURE; GENETIC ALGORITHM; KNOWLEDGE; PRIORITY JOURNAL; ALGORITHM; GENETICS; PRIVACY;

ALGORITHMS; DNA; PRIVACY;

EID: 84905255068     PISSN: 15320464     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jbi.2013.12.016     Document Type: Article

References (43)

1. Das M.K., Dai H.-K. A survey of DNA motif finding algorithms. BMC Bioinformatics 2007, 8. S-7.
2. Kurtz S., Choudhuri J.V., Ohlebusch E., Schleiermacher C., Stoye J., Giegerich R. REPuter: the manifold applications of repeat analysis on a genomic scale. Nucleic Acids Res 2001, 29(22):4633-4642.
3. Tompa M. An exact method for finding short motifs in sequences, with application to the ribosome binding site problem, in: Proceedings of the seventh international conference on intelligent systems on molecular biology; 1999. p. 262-71.
4. van Helden J., Rios A.F., Collado-Vides J. Discovering regulatory elements in non-coding sequences by analysis of spaced dyads. Nucleic Acids Res 2000, 28:1808-1818.
5. Sinha S, Tompa M. A statistical method for finding transcription factor binding site. In: Proc. of the 8th international conference on intelligent systems on molecular biology; 2000. p. 344-54.
6. Pavesi G., Mauri G., Pesole G. An algorithm for finding signals of unknown length in dna sequences. Bioinformatics 2001, 17(Suppl 1):s207-s214.
7. Mewes H.W., Frishman D., Guldener U., Mannhaupt G., Mayer K., Mokrejs M., et al. Mips: a database for genomes and protein sequences. Nucleic Acids Res 2002, 30(1):31-34.
8. Eskin E., Pevzner P. Finding composite regulatory patterns in dna sequences. Bioinformatics 2002, 18(Suppl 1):S354-S363.
9. Buhler J., Tompa M. Finding motifs using random projections. J Comput Biol 2002, 9(2):225-242.
10. Liu FFM, Tsai JJP, Chen RM, Chen SN, Shih SH. FMGA: finding motifs by genetic algorithm. In: Proc of IEEE int symp bioinformatics bioeng; 2004. p. 459-66.
11. Down T.A., Hubbard T.J.P. NestedMICA: sensitive inference of over-represented motifs in nucleic acid sequence. Nucleic Acids Res 2005, 33(5):1445-1453.
12. Shida K. GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima. BMC Bioinformatics 2006, 7:486.
13. Liu D., Xiong X., DasGupta B., Zhang H. Motif discoveries in unaligned molecular sequences using self-organizing neural network. IEEE Trans Neural Netw 2006, 17(4):919-928.
14. Hu J., Yang Y.D., Kihara D. EMD: an ensemble algorithm for discovering regulatory motifs in dna sequences. BMC Bioinformatics 2006, 7:242.
15. Cliften P.F., Hillier L.W., Fulton L., Graves T., Miner T., Gish W.R., et al. Surveying saccharomyces genomes to identify functional elements by comparative dna sequence analysis. Genome Res 2001, 11(7):1175-1186.
16. McCue L., Thompson W., Carmack C., Ryan M., Liu J., Derbyshire V., et al. Phylogenetic footprinting of transcription factor binding sites in proteobacterial genomes. Nucleic Acids Res 2001, 29(3):774-782.
17. Brudno M., Do C.B., Cooper G.M., Kim M.F., Davydov E., Program N.C.S., et al. LAGAN and Multi-LAGAN: efficient tools for large-scale multiple alignment of genomic DNA. Genome Res 2003, 13(3):721-731.
18. Cliften P., Sudarsanam P., Desikan A., Fulton L., Fulton B., Majors J., et al. Finding functional features in saccharomyces genomes by phylogenetic footprinting. Science 2003, 301(5629):71-76.
19. Berezikov E., Guryev V., Plasterk R.H.A., Cuppen E. CONREAL: conserved regulatory elements anchored alignment algorithm for identification of transcription factor binding sites by phylogenetic footprinting. Genome Res 2004, 14(1):170-178.
20. Gelfand M.S., Koonin E.V., Mironov A.A. Prediction of transcription regulatory sites in Archaea by a comparative genome approach. Nucleic Acids Res 2000, 28(3):695-705.
21. Kellis M., Patterson N., Endrizzi M., Birren B., Lander E. Sequencing and comparison of yeast species to identify genes and regulatory element. Nature 2003, 423(6937):241-254.
22. Wang T., Stormo G.D. Combining phylogenetic data with coregulated genes to identify regulatory motifs. Bioinformatics 2003, 19(18):2369-2380.
23. Prakash A, Blanchette M, Sinha S, Tompa M. Efficient discovery of frequent approximate sequential patterns. In: Proc of the ninth Pacific symposium on biocomputing; 2004. p. 348-59.
24. Sinha S., Blanchette M., Tompa M. PhyME: a probabilistic algorithm for finding motifs in sets of orthologous sequences. BMC Bioinformatics 2004, 5:170.
25. Roche P.A., Annas G.J. DNA testing, banking, and genetic privacy. N Engl J Med 2006, 355:545-546.
26. Homer N., Szelinger S., Redman M., Duggan D., Tembe W., Muehling J., et al. Resolving individuals contributing trace amounts of DNA to highly complex mixtures using high-density SNP genotyping microarrays. PLoS Genet 2008, 4(8):1-9.
27. Gymrek M., McGuire A.L., Golan D., Halperin E., Erlich Y. Identifying personal genomes by surname inference. Science 2013, 339(6117):321-324.
28. Malin B.A. An evaluation of the current state of genomic data privacy protection technology and a roadmap for the future. J Am Med Inform Assoc 2005, 12:28-34.
29. Dwork C, McSherry F, Nissim K, Smith A. Calibrating noise to sensitivity in private data analysis. In: Proc of TCC; 2006. p. 265-84.
30. Fienberg SE, Slavkovic AB, Uhler C. Privacy preserving GWAS data sharing. In: Proc of PADM; 2011. p. 628-35.
31. Johnson A, Shmatikov V. Privacy-preserving data exploration in genome-wide association studies. In: Proc of SIGKDD; 2013. p. 1079-87.
32. Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases. In: Proc of VLDB; 1994. p. 487-99.
33. Agrawal R, Srikant R. Mining sequential patterns. In: Proc of ICDE; 1995. p. 3-14.
34. Bhaskar R, Laxman S, Smith A, Thakurta A. Discovering frequent patterns in sensitive data. In: Proc of SIGKDD; 2010. p. 503-12.
35. Li N., Qardaji W.H., Su D., Cao J. Privbasis: frequent itemset mining with differential privacy. Proc VLDB Endow 2012, 8(11):1340-1351.
36. Zeng C., Naughton J.F., Cai J.-Y. On differentially private frequent itemset mining. Proc VLDB Endow 2012, 6(1):25-36.
37. Chen R, Fung BCM, Desai BC, Sossou NM. Differentially private transit data publication: a case study on the Montreal transportation system. In: Proc of SIGKDD; 2012. p. 213-21.
38. Chen R, Acs G, Castelluccia C. Differentially private sequential data publication via variable-length n-grams. In: Proc of CCS; 2012. p. 638-49.
39. Staden R. Methods for discovering novel motifs in nucleic acid sequences. Comput Appl Biosci 1989, 5(4):293-298.
40. McSherry F. Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In: Proc of SIGMOD; 2009. p. 19-30.
41. Rosen K.H. Applications of discrete mathematics 1991, McGraw-Hill. 4th ed.
42. Tompa M., Li N., Bailey T.L., Church G.M., Moor B.D., Eskin E., et al. Assessing computational tools for the discovery of transcription factor binding sites. Nat Biotechnol 2005, 23(1):137-144.
43. Hon L.S., Jain A.N. A deterministic motif finding algorithm with application to the human genome. Bioinformatics 2006, 22(9):1047-1054.