000 04030nam a22004575i 4500
001 978-1-84996-104-2
003 DE-He213
005 20140220084515.0
007 cr nn 008mamaa
008 100715s2010 xxk| s |||| 0|eng d
020 _a9781849961042
_9978-1-84996-104-2
024 7 _a10.1007/978-1-84996-104-2
_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 _aAxelson-Fisk, Marina.
_eauthor.
245 1 0 _aComparative Gene Finding
_h[electronic resource] :
_bModels, Algorithms and Implementation /
_cby Marina Axelson-Fisk.
264 1 _aLondon :
_bSpringer London,
_c2010.
300 _aXV, 304 p.
_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 ;
_v11
505 0 _aSingle Species Gene Finding -- Sequence Alignment -- Comparative Gene Finding -- Gene Structure Submodels -- Parameter Training -- Implementation of a Comparative Gene Finder.
520 _aComparative genomics is an emerging field, which is being fed by an explosion in the number of possible biological sequences. This has led to an immense demand for faster, more efficient and more robust computer algorithms to analyze this large amount of data. This unique text/reference describes the state of the art in computational gene finding, with a particular focus on comparative approaches. Providing both an overview of the various methods that are applied in the field, and a concise guide on how computational gene finders are built, the book covers a broad range of topics from probability theory, statistics, information theory, optimization theory and numerical analysis. The text assumes the reader has some background in bioinformatics, especially in mathematics and mathematical statistics. A basic knowledge of analysis, probability theory and random processes would also aid the reader. Topics and features: Describes how algorithms and sequence alignments can be combined to improve the accuracy of gene finding Introduces the basic biological terms and concepts in genetics, and provides an historical overview of algorithm development Explores the gene features most commonly captured by a computational gene model, and describes the most important sub-models used Discusses the algorithms most commonly used for single-species gene finding Investigates approaches to pairwise and multiple sequence alignments Explains the basics of parameter training, covering a number of the different parameter estimation and optimization techniques commonly used in gene finding Illustrates how to implement a comparative gene finder, explaining the different steps and various accuracy assessment measures used to debug and benchmark the software A useful text for postgraduate students, this book provides valuable insights and examples for researchers wishing to enter the field quickly. In addition to the specific focus on the algorithmic details surrounding computational gene finding, readers obtain an introduction to the fundamentals of computational biology and biological sequence analysis, as well as an overview of the important mathematical and statistical applications in bioinformatics. Dr. Marina Axelson-Fisk is an Associate Professor at the Department of Mathematical Sciences of Chalmers University of Technology, Gothenburg, Sweden.
650 0 _aComputer science.
650 0 _aBioinformatics.
650 1 4 _aComputer Science.
650 2 4 _aComputational Biology/Bioinformatics.
650 2 4 _aBioinformatics.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781849961035
830 0 _aComputational Biology,
_x1568-2684 ;
_v11
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-84996-104-2
912 _aZDB-2-SCS
999 _c110968
_d110968