Bioinformatics Research and Applications Third International Symposium,ISBRA 2007, Atlanta, GA, USA, May 7-10, 2007, Proceedings / edited by Ion Mandoiu, Alexander Zelikovsky.

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Mandoiu, Ion (Editor), Zelikovsky, Alexander (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edition:1st ed. 2007.
Series:Lecture Notes in Bioinformatics ; 4463
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3298460
003 MWH
005 20191027122712.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540720317 
024 7 |a 10.1007/978-3-540-72031-7  |2 doi 
035 |a (DE-He213)978-3-540-72031-7 
050 4 |a E-Book 
072 7 |a PSA  |2 bicssc 
072 7 |a SCI086000  |2 bisacsh 
072 7 |a PSA  |2 thema 
245 1 0 |a Bioinformatics Research and Applications  |h [electronic resource] :  |b Third International Symposium,ISBRA 2007, Atlanta, GA, USA, May 7-10, 2007, Proceedings /  |c edited by Ion Mandoiu, Alexander Zelikovsky. 
250 |a 1st ed. 2007. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2007. 
300 |a XV, 656 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Bioinformatics ;  |v 4463 
490 1 |a Springer eBook Collection 
505 0 |a GFBA: A Biclustering Algorithm for Discovering Value-Coherent Biclusters -- Significance Analysis of Time-Course Gene Expression Profiles -- Data-Driven Smoothness Enhanced Variance Ratio Test to Unearth Responsive Genes in 0-Time Normalized Time-Course Microarray Data -- Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming -- A Multi-Stack Based Phylogenetic Tree Building Method -- A New Linear-Time Heuristic Algorithm for Computing the Parsimony Score of Phylogenetic Networks: Theoretical Bounds and Empirical Performance -- A Bootstrap Correspondence Analysis for Factorial Microarray Experiments with Replications -- Clustering Algorithms Optimizer: A Framework for Large Datasets -- Ranking Function Based on Higher Order Statistics (RF-HOS) for Two-Sample Microarray Experiments -- Searching for Recombinant Donors in a Phylogenetic Network of Serial Samples -- Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls -- Estimating Bacterial Diversity from Environmental DNA: A Maximum Likelihood Approach -- Invited Talk: Modern Homology Search -- Statistical Absolute Evaluation of Gene Ontology Terms with Gene Expression Data -- Discovering Relations Among GO-Annotated Clusters by Graph Kernel Methods -- An Empirical Comparison of Dimensionality Reduction Methods for Classifying Gene and Protein Expression Datasets -- NEURONgrid: A Toolkit for Generating Parameter-Space Maps Using NEURON in a Grid Environment -- An Adaptive Resolution Tree Visualization of Large Influenza Virus Sequence Datasets -- Wavelet Image Interpolation (WII): A Wavelet-Based Approach to Enhancement of Digital Mammography Images -- High Level Programming Environment System for Protein Structure Data -- Finding Minimal Sets of Informative Genes in Microarray Data -- Noise-Based Feature Perturbation as a Selection Method for Microarray Data -- Efficient Generation of Biologically Relevant Enriched Gene Sets -- Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data -- A Fast Approximate Covariance-Model-Based Database Search Method for Non-coding RNA -- Extensions of Naive Bayes and Their Applications to Bioinformatics -- The Solution Space of Sorting by Reversals -- A Fast and Exact Algorithm for the Perfect Reversal Median Problem -- Genomic Signatures from DNA Word Graphs -- Enhancing Motif Refinement by Incorporating Comparative Genomics Data -- Mining Discriminative Distance Context of Transcription Factor Binding Sites on ChIP Enriched Regions -- Enhanced Prediction of Cleavage in Bovine Precursor Sequences -- Invited Talk: A Computational Study of Bidirectional Promoters in the Human Genome -- The Identification of Antisense Gene Pairs Through Available Software -- Inferring Weak Adaptations and Selection Biases in Proteins from Composition and Substitution Matrices -- Markov Model Variants for Appraisal of Coding Potential in Plant DNA -- Predicting Palmitoylation Sites Using a Regularised Bio-basis Function Neural Network -- A Novel Kernel-Based Approach for Predicting Binding Peptides for HLA Class II Molecules -- A Database for Prediction of Unique Peptide Motifs as Linear Epitopes -- A Novel Greedy Algorithm for the Minimum Common String Partition Problem -- An Efficient Algorithm for Finding Gene-Specific Probes for DNA Microarrays -- Multiple Sequence Local Alignment Using Monte Carlo EM Algorithm -- Cancer Class Discovery Using Non-negative Matrix Factorization Based on Alternating Non-negativity-Constrained Least Squares -- A Support Vector Machine Ensemble for Cancer Classification Using Gene Expression Data -- Combining SVM Classifiers Using Genetic Fuzzy Systems Based on AUC for Gene Expression Data Analysis -- A BP-SCFG Based Approach for RNA Secondary Structure Prediction with Consecutive Bases Dependency and Their Relative Positions Information -- Delta: A Toolset for the Structural Analysis of Biological Sequences on a 3D Triangular Lattice -- Statistical Estimate for the Size of the Protein Structural Vocabulary -- Coclustering Based Parcellation of Human Brain Cortex Using Diffusion Tensor MRI -- An Algorithm for Hierarchical Classification of Genes of Prokaryotic Genomes -- Using Multi Level Nearest Neighbor Classifiers for G-Protein Coupled Receptor Sub-families Prediction -- Invited Talk: Ab Initio Gene Finding Engines: What Is Under the Hood -- Reconstruction of 3D Structures from Protein Contact Maps -- A Feature Selection Algorithm Based on Graph Theory and Random Forests for Protein Secondary Structure Prediction -- DNA Sites Buried in Nucleosome Become Accessible at Room Temperature: A Discrete-Event-Simulation Based Modeling Approach -- Comparative Analysis of Gene-Coexpression Networks Across Species -- Comparative Pathway Prediction Via Unified Graph Modeling of Genomic Structure Information -- Extending the Calculus of Looping Sequences to Model Protein Interaction at the Domain Level. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Life sciences. 
650 0 |a Bioinformatics. 
650 0 |a Computers. 
650 0 |a Pattern recognition. 
650 0 |a Data mining. 
690 |a Electronic resources (E-books) 
700 1 |a Mandoiu, Ion.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Zelikovsky, Alexander.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Lecture Notes in Bioinformatics ;  |v 4463 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-540-72031-7  |3 Click to view e-book  |t 0 
907 |a .b32984601  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i22116229  |z 02-26-20 
999 f f |i d6245f6e-fe3e-505e-8d3a-a51b822c1cd0  |s 91ae513e-2028-526f-b21f-440f26d54b99  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File