000 03488nam a22005175i 4500
001 978-3-319-24966-7
003 DE-He213
005 20200420221250.0
007 cr nn 008mamaa
008 151031s2015 gw | s |||| 0|eng d
020 _a9783319249667
_9978-3-319-24966-7
024 7 _a10.1007/978-3-319-24966-7
_2doi
050 4 _aQH324.2-324.25
072 7 _aPSA
_2bicssc
072 7 _aUB
_2bicssc
072 7 _aCOM014000
_2bisacsh
082 0 4 _a570.285
_223
100 1 _aErciyes, Kayhan.
_eauthor.
245 1 0 _aDistributed and Sequential Algorithms for Bioinformatics
_h[electronic resource] /
_cby Kayhan Erciyes.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXVII, 367 p. 157 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aComputational Biology,
_x1568-2684 ;
_v23
520 _aThis unique textbook/reference presents unified coverage of bioinformatics topics relating to both biological sequences and biological networks, providing an in-depth analysis of cutting-edge distributed algorithms, as well as of relevant sequential algorithms. In addition to introducing the latest algorithms in this area, more than fifteen new distributed algorithms are also proposed. Topics and features: Reviews a range of open challenges in biological sequences and networks, beginning with an informal description of the problem before defining it formally Describes in detail both sequential and parallel/distributed algorithms for each problem, briefly discussing software packages if there are any available Suggests approaches for distributed algorithms as possible extensions to sequential algorithms, when the distributed algorithms for the topic are scarce Proposes a number of new distributed algorithms in each chapter, to serve as potential starting points for further research Concludes each chapter with self-test exercises, a summary of the key points, a comparison of the algorithms described, and a literature review This clearly-written and easy to follow work is ideal as a textbook for graduate and senior undergraduate students of computer science and biology, and as a self-study guide for any interested reader with a basic background in discrete mathematic s and algorithms. Researchers in bioinformatics will also find the book to be a useful reference on this subject. Dr. K. Erciyes is Rector of Izmir University, Turkey, where he also serves as a professor in the Computer Engineering Department. His other publications include the Springer title Distributed Graph Algorithms for Computer Networks.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aBioinformatics.
650 0 _aSystems biology.
650 1 4 _aComputer Science.
650 2 4 _aComputational Biology/Bioinformatics.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aSystems Biology.
650 2 4 _aMath Applications in Computer Science.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319249643
830 0 _aComputational Biology,
_x1568-2684 ;
_v23
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-24966-7
912 _aZDB-2-SCS
942 _cEBK
999 _c52546
_d52546