Open this publication in new window or tab >> Show others...
2016 (English) In: Engineering Mathematics II: Algebraic, Stochastic and Analysis Structures for Networks, Data Classification and Optimization / [ed] Sergei Silvestrov; Milica Rancic, Springer, 2016, p. 275-311Chapter in book (Refereed)
Abstract [en] Current cancer therapies including surgery, radiotherapy and chemotherapy are often plagued by high failure rates. Designing more targeted and personalized treatment strategies requires a detailed understanding of druggable tumor drivergenes. As a consequence, the detection of cancer driver genes has evolved to a critical scientific field integrating both high-through put experimental screens as well as computational and statistical strategies. Among such approaches, network based prediction tools have recently been accentuated and received major focus due to their potential to model various aspects of the role of cancer genes in a biological system. In this chapter, we focus on how graph centralities obtained from biological networks have been used to predict cancer genes. Specifically, we start by discussing the current problems in cancer therapy and the reasoning behind using network based cancer gene prediction, followed by an outline of biological networks, their generation and properties. Finally, we review major concepts, recent results as well as future challenges regarding the use of graph centralities in cancer gene prediction.
Place, publisher, year, edition, pages
Springer, 2016
Series
Springer Proceedings in Mathematics and Statistics, ISSN 2194-1009 ; 179
Keywords graph, graph centrality, biological networks, cancer therapies, cancer driver genes, biological system
National Category
Computational Mathematics Bioinformatics (Computational Biology) Bioinformatics and Computational Biology Genetics and Genomics Medical and Health Sciences
Research subject
Mathematics/Applied Mathematics
Identifiers urn:nbn:se:mdh:diva-33381 (URN) 10.1007/978-3-319-42105-6_13 (DOI) 2-s2.0-85012877104 (Scopus ID) 978-3-319-42104-9 (ISBN)978-3-319-42105-6 (ISBN)
2016-10-112016-10-112025-02-05 Bibliographically approved