Algorithms in Bioinformatics - 12th International Workshop, WABI 2012, Ljubljana, Slovenia, September 10-12, 2012. Proceedings
暂无分享,去创建一个
[1] Giovanna Rosone,et al. Lightweight algorithms for constructing and inverting the BWT of string collections , 2013, Theor. Comput. Sci..
[2] Daniel G. Brown,et al. Towards a practical O(nlogn) phylogeny algorithm , 2012, Algorithms for Molecular Biology.
[3] Siu-Ming Yiu,et al. MetaCluster 5.0: a two-round binning approach for metagenomic data for low-abundance species in a noisy sample , 2012, Bioinform..
[4] Charles Semple,et al. Bounding the maximum size of a minimal definitive set of quartets , 2012, Inf. Process. Lett..
[5] Gonzalo Navarro,et al. Fast, Small, Simple Rank/Select on Bitmaps , 2012, SEA.
[6] Manolis Kellis,et al. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss , 2012, Bioinform..
[7] David Fernández-Baca,et al. Extracting conflict-free information from multi-labeled trees , 2012, Algorithms for Molecular Biology.
[8] T. Shibuya,et al. Arapan-S: a fast and highly accurate whole-genome assembly software for viruses and small genomes , 2012, BMC Research Notes.
[9] Jin-Kao Hao,et al. Pattern-driven neighborhood search for biclustering of microarray data , 2012, BMC Bioinformatics.
[10] Sergey I. Nikolenko,et al. SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing , 2012, J. Comput. Biol..
[11] Roded Sharan,et al. Comparative analysis of protein networks , 2012, Commun. ACM.
[12] Giovanna Rosone,et al. Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform , 2012, Bioinform..
[13] Mihai Pop,et al. Exploiting sparseness in de novo genome assembly , 2012, BMC Bioinformatics.
[14] Eran Halperin,et al. MGMR: leveraging RNA-Seq population data to optimize expression estimation , 2012, BMC Bioinformatics.
[15] Manolis Kellis,et al. Unified modeling of gene duplication, loss, and coalescence using a locus tree. , 2012, Genome research.
[16] Simon J. Puglisi,et al. Practical Efficient String Mining , 2012, IEEE Transactions on Knowledge and Data Engineering.
[17] M. Baker. De novo genome assembly: what every biologist should know , 2012, Nature Methods.
[18] Rayan Chikhi,et al. Mapsembler, targeted and micro assembly of large NGS datasets on a desktop computer , 2012, BMC Bioinformatics.
[19] Tandy Warnow,et al. SuperFine: fast and accurate supertree estimation. , 2012, Systematic biology.
[20] G. Getz,et al. High-order chromatin architecture shapes the landscape of chromosomal alterations in cancer , 2012 .
[21] R. Durbin,et al. Efficient de novo assembly of large genomes using compressed data structures. , 2012, Genome research.
[22] Zhi-Zhong Chen,et al. Algorithms for Reticulate Networks of Multiple Phylogenetic Trees , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[23] A. Tanay,et al. Three-Dimensional Folding and Functional Organization Principles of the Drosophila Genome , 2012, Cell.
[24] Siu-Ming Yiu,et al. MetaCluster 4.0: A Novel Binning Algorithm for NGS Reads and Huge Number of Species , 2012, J. Comput. Biol..
[25] N. Carter,et al. Estimation of rearrangement phylogeny for cancer genomes. , 2012, Genome research.
[26] E. Anderson,et al. A new version of PRT software for sibling groups reconstruction with comments regarding several issues in the sibling reconstruction problem , 2012, Molecular ecology resources.
[27] Reza Kalhor,et al. Genome architectures revealed by tethered chromosome conformation capture and population-based modeling , 2011, Nature Biotechnology.
[28] Leo van Iersel,et al. Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set , 2011, SIAM J. Discret. Math..
[29] Arend Hintze,et al. Scaling metagenome sequence assembly with probabilistic de Bruijn graphs , 2011, Proceedings of the National Academy of Sciences.
[30] James B. Brown,et al. Sparse linear modeling of next-generation mRNA sequencing (RNA-Seq) data for isoform discovery and abundance estimation , 2011, Proceedings of the National Academy of Sciences.
[31] S. De,et al. DNA replication timing and long-range DNA interactions predict mutational landscapes of cancer genomes , 2011, Nature Biotechnology.
[32] E. Eichler,et al. Simultaneous structural variation discovery among multiple paired-end sequenced genomes. , 2011, Genome research.
[33] Vipin Kumar,et al. Discovery of error-tolerant biclusters from noisy gene expression data , 2011, BMC Bioinformatics.
[34] G. McVean,et al. De novo assembly and genotyping of variants using colored de Bruijn graphs , 2011, Nature Genetics.
[35] M. David,et al. Metagenomic analysis of a permafrost microbial community reveals a rapid response to thaw , 2011, Nature.
[36] Guillaume Fertin,et al. Pancake Flipping Is Hard , 2011, MFCS.
[37] Mathieu Lupien,et al. PBX1 Genomic Pioneer Function Drives ERα Signaling Underlying Progression in Breast Cancer , 2011, PLoS genetics.
[38] A. Tanay,et al. Probabilistic modeling of Hi-C contact maps eliminates systematic biases to characterize global chromosomal architecture , 2011, Nature Genetics.
[39] Anastassis Perrakis,et al. Automatic rebuilding and optimization of crystallographic structures in the Protein Data Bank , 2011, Bioinform..
[40] Mathieu Blanchette,et al. Three-dimensional modeling of chromatin structure from interaction frequency data using Markov chain Monte Carlo sampling , 2011, BMC Bioinformatics.
[41] Enno Ohlebusch,et al. Computing the longest common prefix array based on the Burrows-Wheeler transform , 2011, J. Discrete Algorithms.
[42] R. Guan,et al. Mitochondrial genome sequencing helps show the evolutionary mechanism of mitochondrial genome formation in Brassica , 2011, BMC Genomics.
[43] Hosein Mohimani,et al. Cycloquest: identification of cyclopeptides via database search of their mass spectra against genome databases. , 2011, Journal of proteome research.
[44] Jens Stoye,et al. Genomic distance under gene substitutions , 2011, BMC Bioinformatics.
[45] Jean-Stéphane Varré,et al. Genome dedoubling by DCJ and reversal , 2011, BMC Bioinformatics.
[46] Jens Stoye,et al. On the weight of indels in genomic distances , 2011, BMC Bioinformatics.
[47] P. Pevzner,et al. Efficient de novo assembly of single-cell bacterial genomes from short-read data sets , 2011, Nature Biotechnology.
[48] Simone Linz,et al. Quantifying Hybridization in Realistic Time , 2011, J. Comput. Biol..
[49] Ho Sung Kang,et al. Homeobox gene Dlx-2 is implicated in metabolic stress-induced necrosis , 2011, Molecular Cancer.
[50] Jens Stoye,et al. Double Cut and Join with Insertions and Deletions , 2011, J. Comput. Biol..
[51] L. Landweber,et al. RNA-Mediated Epigenetic Programming of Genome Rearrangements. , 2011, Annual review of genomics and human genetics.
[52] Jens Stoye,et al. Restricted DCJ Model: Rearrangement Problems with Chromosome Reincorporation , 2011, J. Comput. Biol..
[53] Gad Getz,et al. High-order chromatin architecture determines the landscape of chromosomal alterations in cancer , 2011, Nature Biotechnology.
[54] Tao Jiang,et al. Separating metagenomic short reads into genomes via clustering , 2011, Algorithms for Molecular Biology.
[55] Bonnie Kirkpatrick,et al. Efficiently Solvable Perfect Phylogeny Problems on Binary and k-State Data with Missing Values , 2011, WABI.
[56] Dominique Lavenier,et al. Localized Genome Assembly from Reads to Scaffolds: Practical Traversal of the Paired String Graph , 2011, WABI.
[57] Dan Gusfield,et al. Constructing perfect phylogenies and proper triangulations for three-state characters , 2011, Algorithms for Molecular Biology.
[58] Nadia El-Mabrouk,et al. Removing Noise from Gene Trees , 2011, WABI.
[59] Vincent Berry,et al. Models, algorithms and programs for phylogeny reconciliation , 2011, Briefings Bioinform..
[60] Hosein Mohimani,et al. Sequencing cyclic peptides by multistage mass spectrometry , 2011, Proteomics.
[61] João Meidanis,et al. SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[62] Pierre Baldi,et al. Tree and Hashing Data Structures to Speed up Chemical Searches: Analysis and Experiments , 2011, Molecular informatics.
[63] Isaac Y. Ho,et al. Meraculous: De Novo Genome Assembly with Short Paired-End Reads , 2011, PloS one.
[64] Huanming Yang,et al. Structural variation in two human genomes mapped at single-nucleotide resolution by whole genome de novo assembly , 2011, Nature Biotechnology.
[65] Raj Acharya,et al. A two-way multi-dimensional mixture model for clustering metagenomic sequences , 2011, BCB '11.
[66] Dan Gusfield,et al. Extensions and Improvements to the Chordal Graph Approach to the Multistate Perfect Phylogeny Problem , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[67] Hyungwon Choi,et al. MSblender: A probabilistic approach for integrating peptide identifications from multiple database search engines. , 2011, Journal of proteome research.
[68] N. Friedman,et al. Trinity: reconstructing a full-length transcriptome without a genome from RNA-Seq data , 2011, Nature Biotechnology.
[69] Katharina T. Huber,et al. Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[70] Marc A. Martí-Renom,et al. Bridging the Resolution Gap in Structural Modeling of 3D Genome Organization , 2011, PLoS Comput. Biol..
[71] Kang Ning,et al. Saliva microbiomes distinguish caries-active from healthy human populations , 2011, The ISME Journal.
[72] Robert Giegerich,et al. Forest Alignment with Affine Gaps and Anchors , 2011, CPM.
[73] Giovanna Rosone,et al. Lightweight BWT Construction for Very Large String Collections , 2011, CPM.
[74] Siu-Ming Yiu,et al. Meta-IDBA: a de Novo assembler for metagenomic data , 2011, Bioinform..
[75] David Fernández-Baca,et al. A simple characterization of the minimal obstruction sets for three-state perfect phylogenies , 2011, Appl. Math. Lett..
[76] Cole Trapnell,et al. Computational methods for transcriptome annotation and quantification using RNA-seq , 2011, Nature Methods.
[77] Oliver Eulenstein,et al. Algorithms for Rapid Error Correction for the Gene Duplication Problem , 2011, ISBRA.
[78] V. Barbe,et al. Structural and Content Diversity of Mitochondrial Genome in Beet: A Comparative Genomic Analysis , 2011, Genome biology and evolution.
[79] Michel Habib,et al. On a Conjecture about Compatibility of Multi-states Characters , 2011, WABI.
[80] Zasha Weinberg,et al. Identification of Hammerhead Ribozymes in All Domains of Life Reveals Novel Structural Variations , 2011, PLoS Comput. Biol..
[81] Fedor V. Fomin,et al. Subexponential parameterized algorithm for minimum fill-in , 2011, SODA.
[82] Shamil R. Sunyaev,et al. Assigning spectrum-specific P-values to protein identifications by mass spectrometry , 2011, Bioinform..
[83] Pavel A. Pevzner,et al. Multiplex De Novo Sequencing of Peptide Antibiotics , 2011, RECOMB.
[84] Tao Jiang,et al. IsoLasso: A LASSO Regression Approach to RNA-Seq Based Transcriptome Assembly - (Extended Abstract) , 2011, RECOMB.
[85] Wing-Kin Sung,et al. Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences , 2011, RECOMB.
[86] Dong Chen,et al. JunD and JunB integrate prostaglandin E2 activation of breast cancer-associated proximal aromatase promoters. , 2011, Molecular endocrinology.
[87] J. Vederas,et al. [Drug discovery and natural products: end of era or an endless frontier?]. , 2011, Biomeditsinskaia khimiia.
[88] Sorin Istrail,et al. The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS , 2010, RECOMB.
[89] Carl Kingsford,et al. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers , 2011, Bioinform..
[90] Michael T. Hallett,et al. Simultaneous Identification of Duplications and Lateral Gene Transfers , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[91] Vincent Berry,et al. Building species trees from larger parts of phylogenomic databases , 2011, Inf. Comput..
[92] Toni Gabaldón,et al. TreeKO: a duplication-aware algorithm for the comparison of phylogenetic trees , 2011, Nucleic acids research.
[93] S. Tringe,et al. Metagenomic Discovery of Biomass-Degrading Genes and Genomes from Cow Rumen , 2011, Science.
[94] Enno Ohlebusch,et al. Fast and Lightweight LCP-Array Construction Algorithms , 2011, ALENEX.
[95] Johannes Fischer,et al. Inducing the LCP-Array , 2011, WADS.
[96] R. Holt,et al. Targeted Assembly of Short Sequence Reads , 2011, PloS one.
[97] Ran Libeskind-Hadas,et al. The Cophylogeny Reconstruction Problem Is NP-Complete , 2011, J. Comput. Biol..
[98] Lawrence A. David,et al. Rapid evolutionary innovation during an Archaean genetic expansion , 2011, Nature.
[99] Dale Schuurmans,et al. Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering , 2010, COCOA.
[100] Steven Salzberg,et al. Mugsy: fast multiple alignment of closely related whole genomes , 2010, Bioinform..
[101] Jijun Tang,et al. Phylogenetic reconstruction with gene rearrangements and gene losses , 2010, 2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM).
[102] David R. Kelley,et al. Quake: quality-aware detection and correction of sequencing errors , 2010, Genome Biology.
[103] D. Huson,et al. A Survey of Combinatorial Methods for Phylogenetic Networks , 2010, Genome biology and evolution.
[104] Zhi-Zhong Chen,et al. HybridNET: a tool for constructing hybridization networks , 2010, Bioinform..
[105] Steven J. M. Jones,et al. De novo assembly and analysis of RNA-seq data , 2010, Nature Methods.
[106] Hideki Tanizawa,et al. Mapping of long-range associations throughout the fission yeast genome reveals global genome organization linked to transcriptional regulation , 2010, Nucleic acids research.
[107] Monzoorul Haque Mohammed,et al. DiScRIBinATE: a rapid method for accurate taxonomic classification of metagenomic sequences , 2010, BMC Bioinformatics.
[108] Marie-France Sagot,et al. Identifying SNPs without a Reference Genome by Comparing Raw Reads , 2010, SPIRE.
[109] Enno Ohlebusch,et al. Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes , 2010, SPIRE.
[110] A. Nesvizhskii. A survey of computational methods and error rate estimation procedures for peptide and protein identification in shotgun proteomics. , 2010, Journal of proteomics.
[111] Vincent Berry,et al. An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers , 2010, RECOMB-CG.
[112] Jens Stoye,et al. The Solution Space of Sorting by DCJ , 2010, J. Comput. Biol..
[113] P. Pevzner,et al. The Generating Function of CID, ETD, and CID/ETD Pairs of Tandem Mass Spectra: Applications to Database Search* , 2010, Molecular & Cellular Proteomics.
[114] Daniel G. Brown,et al. Discovering Kinship through Small Subsets , 2010, WABI.
[115] Jens Stoye,et al. Genomic Distance with DCJ and Indels , 2010, WABI.
[116] Derek Y. Chiang,et al. MapSplice: Accurate mapping of RNA-seq reads for splice junction discovery , 2010, Nucleic acids research.
[117] Dominique Lavenier,et al. GASSST: global alignment short sequence search tool , 2010, Bioinform..
[118] Pierre Baldi,et al. Hashing Algorithms and Data Structures for Rapid Searches of Fingerprint Vectors , 2010, J. Chem. Inf. Model..
[119] Thomas C. Conway,et al. Succinct data structures for assembling large genomes , 2010, Bioinform..
[120] Karin Jirström,et al. Homeobox transcription factor muscle segment homeobox 2 (Msx2) correlates with good prognosis in breast cancer patients and induces apoptosis in vitro , 2010, Breast Cancer Research.
[121] See-Kiong Ng,et al. An Indexing Scheme for Fast and Accurate Chemical Fingerprint Database Searching , 2010, SSDBM.
[122] N. Perna,et al. progressiveMauve: Multiple Genome Alignment with Gene Gain, Loss and Rearrangement , 2010, PloS one.
[123] Jared T. Simpson,et al. Efficient construction of an assembly string graph using the FM-index , 2010, Bioinform..
[124] S. Koren,et al. Assembly algorithms for next-generation sequencing data. , 2010, Genomics.
[125] Pinar Heggernes,et al. A Parameterized Algorithm for Chordal Sandwich , 2010, CIAC.
[126] Zhaohui S. Qin,et al. A Global Protein Kinase and Phosphatase Interaction Network in Yeast , 2010, Science.
[127] Norbert Zeh,et al. Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments , 2010, SEA.
[128] Cole Trapnell,et al. Transcript assembly and quantification by RNA-Seq reveals unannotated transcripts and isoform switching during cell differentiation. , 2010, Nature biotechnology.
[129] J. Rinn,et al. Ab initio reconstruction of transcriptomes of pluripotent and lineage committed cells reveals gene structures of thousands of lincRNAs , 2010, Nature Biotechnology.
[130] Yu-Wei Wu,et al. A Novel Abundance-Based Algorithm for Binning Metagenomic Sequences Using l-Tuples , 2010, RECOMB.
[131] David Fernández-Baca,et al. Graph triangulations and the compatibility of unrooted phylogenetic trees , 2010, Appl. Math. Lett..
[132] D. Auboeuf,et al. NFAT3 transcription factor inhibits breast cancer cell motility by targeting the Lipocalin 2 gene , 2010, Oncogene.
[133] M. Berriman,et al. Improving draft assemblies by iterative mapping and assembly of short reads to eliminate gaps , 2010, Genome Biology.
[134] Juan M. Vaquerizas,et al. Comprehensive reanalysis of transcription factor knockout expression data in Saccharomyces cerevisiae reveals many new targets , 2010, Nucleic acids research.
[135] A. Darracq,et al. A scenario of mitochondrial genome evolution in maize based on rearrangement events , 2010, BMC Genomics.
[136] Y. Xing,et al. Detection of splice junctions from paired-end RNA-seq data by SpliceMap , 2010, Nucleic acids research.
[137] W. Art Chaovalitwongse,et al. New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers , 2010, INFORMS J. Comput..
[138] Martine Labbé,et al. A Class Representative Model for Pure Parsimony Haplotyping , 2010, INFORMS J. Comput..
[139] William Stafford Noble,et al. A Three-Dimensional Model of the Yeast Genome , 2010, Nature.
[140] Alain Denise,et al. Alignments of RNA Structures , 2010, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[141] Jonathan W. Essex,et al. Ensemble Docking into Multiple Crystallographically Derived Protein Structures: An Evaluation Based on the Statistical Analysis of Enrichments , 2010, J. Chem. Inf. Model..
[142] B. Letcher,et al. PedAgree: software to quantify error and assess accuracy and congruence for genetically reconstructed pedigree relationships , 2010, Conservation Genetics Resources.
[143] P. Bork,et al. A human gut microbial gene catalogue established by metagenomic sequencing , 2010, Nature.
[144] David Fernández-Baca,et al. Robinson-Foulds Supertrees , 2010, Algorithms for Molecular Biology.
[145] Ran Libeskind-Hadas,et al. Jane: a new tool for the cophylogeny reconstruction problem , 2010, Algorithms for Molecular Biology.
[146] Huanming Yang,et al. De novo assembly of human genomes with massively parallel short read sequencing. , 2010, Genome research.
[147] Guoliang Li,et al. Analyzing the Fitch Method for Reconstructing Ancestral States on Ultrametric Phylogenetic Trees , 2010, Bulletin of mathematical biology.
[148] Martin Bader,et al. Genome rearrangements with duplications , 2010, BMC Bioinformatics.
[149] Christophe Zimmer,et al. Chromosome arm length and nuclear constraints determine the dynamic relationship of yeast subtelomeres , 2010, Proceedings of the National Academy of Sciences.
[150] Mihai Pop,et al. Assembly complexity of prokaryotic genomes using short reads , 2010, BMC Bioinformatics.
[151] Christian N. S. Pedersen,et al. A tree-based method for the rapid screening of chemical fingerprints , 2009, Algorithms for Molecular Biology.
[152] Roded Sharan,et al. Network-Free Inference of Knockout Effects in Yeast , 2010, PLoS Comput. Biol..
[153] Daniel R. Zerbino,et al. Pebble and Rock Band: Heuristic Resolution of Repeats and Scaffolding in the Velvet Short-Read de Novo Assembler , 2009, PloS one.
[154] M. Bernt,et al. Gene order rearrangement methods for the reconstruction of phylogeny , 2009 .
[155] Roland L. Dunbrack,et al. proteins STRUCTURE O FUNCTION O BIOINFORMATICS Improved prediction of protein side-chain conformations with SCWRL4 , 2022 .
[156] Siu-Ming Yiu,et al. Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers , 2009, BMC Bioinformatics.
[157] Inanç Birol,et al. De novo transcriptome assembly with ABySS , 2009, Bioinform..
[158] Fabrizio Luccio,et al. Compressing and indexing labeled trees, with applications , 2009, JACM.
[159] Richard Friedberg,et al. DCJ Path Formulation for Genome Transformations which Include Insertions, Deletions, and Duplications , 2009, J. Comput. Biol..
[160] Ujjwal Maulik,et al. A Novel Coherence Measure for Discovering Scaling Biclusters from Gene Expression Data , 2009, J. Bioinform. Comput. Biol..
[161] A. Gnirke,et al. ALLPATHS 2: small genomes assembled accurately and with high continuity from short paired reads , 2009, Genome Biology.
[162] Travis Gagie,et al. Lightweight Data Indexing and Compression in External Memory , 2009, Algorithmica.
[163] Vincent Moulton,et al. Inferring polyploid phylogenies from multiply-labeled gene trees , 2009, BMC Evolutionary Biology.
[164] Siu-Ming Yiu,et al. SOAP2: an improved ultrafast tool for short read alignment , 2009, Bioinform..
[165] S. Salzberg,et al. Phymm and PhymmBL: Metagenomic Phylogenetic Classification with Interpolated Markov Models , 2009, Nature Methods.
[166] Pierre Baldi,et al. An Intersection Inequality Sharper than the Tanimoto Triangle Inequality for Efficiently Searching Large Databases , 2009, J. Chem. Inf. Model..
[167] Nuno Bandeira,et al. Dereplication and De Novo Sequencing of Nonribosomal Peptides , 2009, Nature Methods.
[168] Mihai Pop,et al. Parametric Complexity of Sequence Assembly: Theory and Applications to Next Generation Sequencing , 2009, J. Comput. Biol..
[169] Mihai Pop,et al. Genome assembly reborn: recent computational challenges , 2009, Briefings Bioinform..
[170] Snehit Prabhu,et al. Overlapping Pools for High Throughput Targeted Resequencing , 2009, RECOMB.
[171] B Dasgupta,et al. KINALYZER, a computer program for reconstructing sibling groups , 2009, Molecular ecology resources.
[172] Monzoorul Haque Mohammed,et al. SOrt-ITEMS: Sequence orthology based approach for improved taxonomic estimation of metagenomic sequences , 2009, Bioinform..
[173] Serita M. Nelesen,et al. Rapid and Accurate Large-Scale Coestimation of Sequence Alignments and Phylogenetic Trees , 2009, Science.
[174] Matthias Bernt,et al. Finding all sorting tandem duplication random loss operations , 2009, J. Discrete Algorithms.
[175] Juha Kärkkäinen,et al. Permuted Longest-Common-Prefix Array , 2009, CPM.
[176] Dale Schuurmans,et al. Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting , 2009, COCOA.
[177] Guy Perrière,et al. Databases of homologous gene families for comparative genomics , 2009, BMC Bioinformatics.
[178] Ying Xu,et al. QUBIC: a qualitative biclustering algorithm for analyses of gene expression data , 2009, Nucleic acids research.
[179] Guillaume Fertin,et al. Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.
[180] Steven J. M. Jones,et al. Abyss: a Parallel Assembler for Short Read Sequence Data Material Supplemental Open Access , 2022 .
[181] Dan Gusfield,et al. The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory , 2009, RECOMB.
[182] Nadia El-Mabrouk,et al. New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees , 2009, RECOMB.
[183] Gerardo Rubino,et al. Rare Event Simulation using Monte Carlo Methods , 2009 .
[184] Dan Gusfield,et al. Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters , 2009, SIAM J. Discret. Math..
[185] Kunihiko Sadakane,et al. Fully Functional Static and Dynamic Succinct Trees , 2009, TALG.
[186] David Sankoff,et al. Multichromosomal median and halving problems under different genomic distances , 2009, BMC Bioinformatics.
[187] Vladimir Kolmogorov,et al. Blossom V: a new implementation of a minimum cost perfect matching algorithm , 2009, Math. Program. Comput..
[188] Adam P. Arkin,et al. FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix , 2009, Molecular biology and evolution.
[189] J. Lagergren,et al. Simultaneous Bayesian gene tree reconstruction and reconciliation analysis , 2009, Proceedings of the National Academy of Sciences.
[190] Bengt Sennblad,et al. The gene evolution model and computing its associated probabilities , 2009, JACM.
[191] David Sankoff,et al. Genome Halving with Double Cut and Join , 2009, APBC.
[192] S. Salzberg,et al. TopHat: discovering splice junctions with RNA-Seq , 2009, Bioinform..
[193] Cole Trapnell,et al. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome , 2009, Genome Biology.
[194] Yun Yen,et al. Methylation of homeobox genes is a frequent and early epigenetic event in breast cancer , 2009, Breast Cancer Research.
[195] B. Browning,et al. A unified approach to genotype imputation and haplotype-phase inference for large data sets of trios and unrelated individuals. , 2009, American journal of human genetics.
[196] Naryttza N. Diaz,et al. TACOA – Taxonomic classification of environmental genomic fragments using a kernelized nearest neighbor approach , 2009, BMC Bioinformatics.
[197] Ora Schueler-Furman,et al. Rapid Sampling of Molecular Motions with Prior Information Constraints , 2009, PLoS Comput. Biol..
[198] Marni Mishna,et al. Average-Case Analysis of Perfect Sorting by Reversals , 2009, Discret. Math. Algorithms Appl..
[199] Dahlia R. Weiss,et al. Can morphing methods predict intermediate structures? , 2009, Journal of molecular biology.
[200] N. Go,et al. Studies on protein folding, unfolding and fluctuations by computer simulation. I. The effect of specific amino acid sequence represented by specific inter-unit interactions. , 2009 .
[201] Ran Libeskind-Hadas,et al. On the Computational Complexity of the Reticulate Cophylogeny Reconstruction Problem , 2009, J. Comput. Biol..
[202] Simon J. Puglisi,et al. Space-Time Tradeoffs for Longest-Common-Prefix Array Computation , 2008, ISAAC.
[203] Johannes Fischer,et al. Space Efficient String Mining under Frequency Constraints , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[204] Shuai Cheng Li,et al. Fragment‐HMM: A new approach to protein structure prediction , 2008, Protein science : a publication of the Protein Society.
[205] Peer Bork,et al. Discovering Functional Novelty in Metagenomes: Examples from Light-Mediated Processes , 2008, Journal of bacteriology.
[206] Daniel H. Huson,et al. MetaSim—A Sequencing Simulator for Genomics and Metagenomics , 2008, PloS one.
[207] Sarah J. Bourlat,et al. Testing the new animal phylogeny: a phylum level molecular analysis of the animal kingdom. , 2008, Molecular phylogenetics and evolution.
[208] David Haussler,et al. The infinite sites model of genome evolution , 2008, Proceedings of the National Academy of Sciences.
[209] H. Hoos,et al. RNA STRAND: The RNA Secondary Structure and Statistical Analysis Database , 2008, BMC Bioinformatics.
[210] Enno Ohlebusch,et al. A space efficient solution to the frequent string mining problem for many databases , 2008, Data Mining and Knowledge Discovery.
[211] Yaoqi Zhou,et al. Specific interactions for ab initio folding of protein terminal regions with secondary structures , 2008, Proteins.
[212] Juliane C. Dohm,et al. Substantial biases in ultra-short read data sets from high-throughput DNA sequencing , 2008, Nucleic acids research.
[213] Amar Mukherjee,et al. The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching , 2008 .
[214] Katharina T. Huber,et al. The Complexity of Deriving Multi-Labeled Trees from Bipartitions , 2008, J. Comput. Biol..
[215] P. Pevzner,et al. Spectral probabilities and generating functions of tandem mass spectra: a strike against decoy databases. , 2008, Journal of proteome research.
[216] Pierre Baldi,et al. Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive OR , 2008, J. Chem. Inf. Model..
[217] Yaoqi Zhou,et al. Ab initio folding of terminal segments with secondary structures reveals the fine difference between two closely related all‐atom statistical energy functions , 2008, Protein science : a publication of the Protein Society.
[218] M. Middendorf,et al. Solving the Preserving Reversal Median Problem , 2008, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[219] Julia Mixtacki,et al. Genome Halving under DCJ Revisited , 2008, COCOON.
[220] Duhong Chen,et al. The PhyLoTA Browser: processing GenBank for molecular phylogenetics research. , 2008, Systematic biology.
[221] E. Birney,et al. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. , 2008, Genome research.
[222] Eaton E. Lattman,et al. Protein Crystallography: A Concise Guide , 2008 .
[223] Hong Yan,et al. Discovering biclusters in gene expression data based on high-dimensional linear geometries , 2008, BMC Bioinformatics.
[224] Christophe Paul,et al. A more efficient algorithm for perfect sorting by reversals , 2008, Inf. Process. Lett..
[225] Robert Giegerich,et al. BMC Bioinformatics BioMed Central Methodology article Efficient computation of absent words in genomic sequences , 2008 .
[226] Mihai Pop,et al. Scaffolding and validation of bacterial genome assemblies using optical restriction maps , 2008, Bioinform..
[227] Naryttza N. Diaz,et al. Phylogenetic classification of short environmental DNA fragments , 2008, Nucleic acids research.
[228] Mark J. P. Chaisson,et al. Short read fragment assembly of bacterial genomes. , 2008, Genome research.
[229] Elchanan Mossel,et al. Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep , 2008, SIAM J. Discret. Math..
[230] Sagi Snir,et al. Fast and reliable reconstruction of phylogenetic trees with very short edges , 2008, SODA '08.
[231] Kunihiko Sadakane,et al. Compressed Suffix Trees with Full Functionality , 2007, Theory of Computing Systems.
[232] Antonio Restivo,et al. An extension of the Burrows-Wheeler Transform , 2007, Theor. Comput. Sci..
[233] Matthias Bernt,et al. CREx: inferring genomic rearrangements based on common intervals , 2007, Bioinform..
[234] Werner Sandmann,et al. Applicability of Importance Sampling to Coupled Molecular Reactions , 2007 .
[235] Jeremiah J. Faith,et al. Many Microbe Microarrays Database: uniformly normalized Affymetrix compendia with structured experimental metadata , 2007, Nucleic Acids Res..
[236] Qian Wu,et al. Role of specificity protein transcription factors in estrogen-induced gene expression in MCF-7 breast cancer cells. , 2007, Journal of molecular endocrinology.
[237] A. Chhabra,et al. Expression of transcription factor CREB1 in human breast cancer and its correlation with prognosis. , 2007, Oncology reports.
[238] Alexey I Nesvizhskii,et al. Analysis and validation of proteomic data generated by tandem mass spectrometry , 2007, Nature Methods.
[239] B Vernot,et al. Reconciliation with Non-Binary Species Trees , 2007, J. Comput. Biol..
[240] Zhaojun Bai,et al. CompostBin: A DNA Composition-Based Algorithm for Binning Environmental Shotgun Reads , 2007, RECOMB.
[241] Guang Song,et al. How well can we understand large-scale protein motions using normal modes of elastic network models? , 2007, Biophysical journal.
[242] Peter W. Glynn,et al. Stochastic Simulation: Algorithms and Analysis , 2007 .
[243] Alexander Tiskin,et al. Semi-local String Comparison: Algorithmic Techniques and Applications , 2007, Math. Comput. Sci..
[244] Matthew W. Hahn,et al. Bias in phylogenetic tree reconciliation methods: implications for vertebrate genome evolution , 2007, Genome Biology.
[245] Roded Sharan,et al. SPINE: a framework for signaling-regulatory pathway inference from cause-effect experiments , 2007, ISMB/ECCB.
[246] Sebastian Doniach,et al. MinActionPath: maximum likelihood trajectory for large-scale structural transitions in a coarse-grained locally harmonic energy landscape , 2007, Nucleic Acids Res..
[247] James O. McInerney,et al. TOPD/FMTS: a new software to compare phylogenetic trees , 2007, Bioinform..
[248] Simone Linz,et al. A Reduction Algorithm for Computing The Hybridization Number of Two Trees , 2007, Evolutionary bioinformatics online.
[249] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.
[250] Gonzalo Navarro,et al. Compressed representations of sequences and full-text indexes , 2007, TALG.
[251] M. Gilski,et al. Stereochemical restraints revisited: how accurate are refinement targets and how much should protein structures be allowed to deviate from them? , 2007 .
[252] Gonzalo Navarro,et al. Compressed full-text indexes , 2007, CSUR.
[253] Yoshiko Wakabayashi,et al. The maximum agreement forest problem: Approximation algorithms and computational experiments , 2007, Theor. Comput. Sci..
[254] Charles Semple,et al. Computing the minimum number of hybridization events for a consistent evolutionary history , 2007, Discret. Appl. Math..
[255] Steven P Gygi,et al. Target-decoy search strategy for increased confidence in large-scale protein identifications by mass spectrometry , 2007, Nature Methods.
[256] Pierre Baldi,et al. Bounds and Algorithms for Fast Exact Searches of Chemical Fingerprints in Linear and Sublinear Time , 2007, J. Chem. Inf. Model..
[257] Michael J. Keiser,et al. Relating protein pharmacology by ligand chemistry , 2007, Nature Biotechnology.
[258] Jean-Michel Claverie,et al. Reductive Genome Evolution from the Mother of Rickettsia , 2007, PLoS genetics.
[259] Henk A. P. Blom,et al. Free Flight Collision Risk Estimation by Sequential MC Simulation , 2006 .
[260] Peter Sanders,et al. Linear work suffix array construction , 2006, JACM.
[261] Clifford A. Meyer,et al. Genome-wide analysis of estrogen receptor binding sites , 2006, Nature Genetics.
[262] Stefan Kramer,et al. A new representation for protein secondary structure prediction based on frequent patterns , 2006, Bioinform..
[263] Alexandros Stamatakis,et al. RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models , 2006, Bioinform..
[264] Kunihiko Sadakane,et al. Practical Entropy-Compressed Rank/Select Dictionary , 2006, ALENEX.
[265] Volker Heun,et al. Optimal String Mining Under Frequency Constraints , 2006, PKDD.
[266] Jens Stoye,et al. A Unifying View of Genome Rearrangements , 2006, WABI.
[267] Michael Mitzenmacher,et al. Less hashing, same performance: Building a better Bloom filter , 2006, Random Struct. Algorithms.
[268] Natalia N. Ivanova,et al. Symbiosis insights through metagenomic analysis of a microbial consortium. , 2006, Nature Reviews Microbiology.
[269] R. Meech,et al. BARX2 and estrogen receptor-α (ESR1) coordinately regulate the production of alternatively spliced ESR1 isoforms and control breast cancer cell growth and invasion , 2006, Oncogene.
[270] Douglas L. Theobald,et al. THESEUS: maximum likelihood superpositioning and analysis of macromolecular structures , 2006, Bioinform..
[271] Oliver Eulenstein,et al. Reconciling Gene Trees with Apparent Polytomies , 2006, COCOON.
[272] Matthew J. Betts,et al. Optimal Gene Trees from Sequences and Species Trees Using a Soft Interpretation of Parsimony , 2006, Journal of Molecular Evolution.
[273] E. Jan. Divergent IRES elements in invertebrates. , 2006, Virus research.
[274] M. Pop,et al. Metagenomic Analysis of the Human Distal Gut Microbiome , 2006, Science.
[275] H. Gohlke,et al. Multiscale modeling of macromolecular conformational changes combining concepts from rigidity and elastic network theory , 2006, Proteins.
[276] Lothar Thiele,et al. A systematic comparison and evaluation of biclustering methods for gene expression data , 2006, Bioinform..
[277] Sylvain Gaillard,et al. Bio++: a set of C++ libraries for sequence analysis, phylogenetics, molecular evolution and population genetics , 2006, BMC Bioinformatics.
[278] Ting Wang,et al. An improved map of conserved regulatory sites for Saccharomyces cerevisiae , 2006, BMC Bioinformatics.
[279] David Bryant,et al. Compatibility of unrooted phylogenetic trees is FPT , 2006, Theor. Comput. Sci..
[280] K. T. Huber,et al. Phylogenetic networks from multi-labelled trees , 2006, Journal of mathematical biology.
[281] Eoin L. Brodie,et al. Greengenes: Chimera-checked 16S rRNA gene database and workbench compatible in ARB , 2006 .
[282] H. Tettelin,et al. The microbial pan-genome. , 2005, Current opinion in genetics & development.
[283] A. Toker,et al. Akt blocks breast cancer cell motility and invasion through the transcription factor NFAT. , 2005, Molecular cell.
[284] Julien Allali,et al. A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison , 2005, SPIRE.
[285] P. Højrup,et al. VEMS 3.0: algorithms and computational tools for tandem mass spectrometry based identification of post-translational modifications in proteins. , 2005, Journal of proteome research.
[286] Antonio Restivo,et al. A New Combinatorial Approach to Sequence Comparison , 2005, Theory of Computing Systems.
[287] Tandy J. Warnow,et al. Pattern Identification in Biogeography , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[288] Mathieu Raffinot,et al. Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs , 2005, SIAM J. Discret. Math..
[289] Bin Wu,et al. Solution structure of YKR049C, a putative redox protein from Saccharomyces cerevisiae. , 2005, Journal of biochemistry and molecular biology.
[290] James R. Knight,et al. Genome sequencing in microfabricated high-density picolitre reactors , 2005, Nature.
[291] Xiaoqiu Huang,et al. Generating a Genome Assembly with PCAP , 2005, Current protocols in bioinformatics.
[292] O. Attie,et al. Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005 .
[293] Bonnie Berger,et al. A tree-decomposition approach to protein structure prediction , 2005, 2005 IEEE Computational Systems Bioinformatics Conference (CSB'05).
[294] Guoli Wang,et al. PISCES: recent improvements to a PDB sequence culling server , 2005, Nucleic Acids Res..
[295] Mohammed J. Zaki,et al. TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data , 2005, SIGMOD '05.
[296] P. Pevzner,et al. InsPecT: identification of posttranslationally modified peptides from tandem mass spectra. , 2005, Analytical chemistry.
[297] Philip Bille,et al. A survey on tree edit distance and related problems , 2005, Theor. Comput. Sci..
[298] Victor A. Campos,et al. On the asymmetric representatives formulation for the vertex coloring problem , 2005, Discret. Appl. Math..
[299] Andrés Moya,et al. Genome Rearrangement Distances and Gene Order Phylogeny in γ-Proteobacteria , 2005 .
[300] D. B. Weatherly,et al. A Heuristic Method for Assigning a False-discovery Rate for Protein Identifications from Mascot Database Search Results * , 2005, Molecular & Cellular Proteomics.
[301] Tom Tregenza,et al. Measuring polyandry in wild populations: a case study using promiscuous crickets , 2005, Molecular ecology.
[302] Dannie Durand,et al. A Hybrid Micro-Macroevolutionary Approach to Gene Tree Reconstruction , 2005, RECOMB.
[303] Jinbo Xu,et al. Rapid Protein Side-Chain Packing via Tree Decomposition , 2005, RECOMB.
[304] V. Moulton,et al. Bounding the Number of Hybridisation Events for a Consistent Evolutionary History , 2005, Journal of mathematical biology.
[305] Hans L. Bodlaender,et al. Discovering Treewidth , 2005, SOFSEM.
[306] Eugene W. Myers,et al. The fragment assembly string graph , 2005, ECCB/JBI.
[307] Peter D. Karp,et al. EcoCyc: a comprehensive database resource for Escherichia coli , 2004, Nucleic Acids Res..
[308] David Botstein,et al. GO: : TermFinder--open source software for accessing Gene Ontology information and finding significantly enriched Gene Ontology terms associated with a list of genes , 2004, Bioinform..
[309] Y. Isagi,et al. Highly Variable Pollination Patterns in Magnolia obovata Revealed by Microsatellite Paternity Analysis , 2004, International Journal of Plant Sciences.
[310] Frank Oliver Glöckner,et al. TETRA: a web-service and a stand-alone program for the analysis and comparison of tetranucleotide usage patterns in DNA sequences , 2004, BMC Bioinformatics.
[311] Bengt Oxelman,et al. Polyploid origins in a circumpolar complex in Draba (Brassicaceae) inferred from cloned nuclear DNA sequences and fingerprints. , 2004, Molecular phylogenetics and evolution.
[312] Sven Bergmann,et al. Defining transcription modules using large-scale gene expression data , 2004, Bioinform..
[313] Adam M. Phillippy,et al. Comparative genome assembly , 2004, Briefings Bioinform..
[314] Tommi S. Jaakkola,et al. Physical Network Models , 2004, J. Comput. Biol..
[315] Ron Y. Pinter,et al. Approximate labelled subtree homeomorphism , 2004, J. Discrete Algorithms.
[316] F. Blattner,et al. Mauve: multiple alignment of conserved genomic sequence with rearrangements. , 2004, Genome research.
[317] S. Bryant,et al. Open mass spectrometry search algorithm. , 2004, Journal of proteome research.
[318] Brian K Shoichet,et al. Testing a flexible-receptor docking algorithm in a model binding site. , 2004, Journal of molecular biology.
[319] D. Haussler,et al. Aligning multiple genomic sequences with the threaded blockset aligner. , 2004, Genome research.
[320] Pawel Górecki,et al. Reconciliation problems for duplication, loss and horizontal gene transfer , 2004, RECOMB.
[321] Tandy J. Warnow,et al. Reconstructing reticulate evolution in species: theory and practice , 2004, RECOMB.
[322] Bengt Sennblad,et al. Gene tree reconstruction and orthology analysis based on an integrated model for duplications and sequence evolution , 2004, RECOMB.
[323] Michael T. Hallett,et al. Simultaneous identification of duplications and lateral transfers , 2004, RECOMB.
[324] J. Banfield,et al. Community structure and metabolism through reconstruction of microbial genomes from the environment , 2004, Nature.
[325] Enno Ohlebusch,et al. Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.
[326] J. Yates,et al. Statistical models for protein validation using tandem mass spectral data and protein amino acid sequence databases. , 2004, Analytical chemistry.
[327] R. Aebersold,et al. Analysis, statistical validation and dissemination of large-scale proteomics datasets generated by tandem MS. , 2004, Drug discovery today.
[328] M. Gerstein,et al. Conformational changes associated with protein-protein interactions. , 2004, Current opinion in structural biology.
[329] S. Salzberg,et al. Versatile and open software for comparing large genomes , 2004, Genome Biology.
[330] Bernard Chazelle,et al. The Bloomier filter: an efficient data structure for static support lookup tables , 2004, SODA '04.
[331] S. Salzberg,et al. Hierarchical scaffolding with Bambus. , 2003, Genome research.
[332] Michael R. Fellows,et al. Analogs & duals of the MAST problem for sequences & trees , 2003, J. Algorithms.
[333] Dong Xu,et al. PROSPECT II: protein structure prediction program for genome-scale applications. , 2003, Protein engineering.
[334] Guoli Wang,et al. PISCES: a protein sequence culling server , 2003, Bioinform..
[335] Robert Giegerich,et al. Local similarity in RNA secondary structures , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.
[336] M L Teodoro,et al. Conformational flexibility models for the receptor in structure based drug design. , 2003, Current pharmaceutical design.
[337] Joachim Klose,et al. Interpretation of mass spectrometry data for high-throughput proteomics , 2003, Analytical and bioanalytical chemistry.
[338] S. Teague. Implications of protein flexibility for drug discovery , 2003, Nature Reviews Drug Discovery.
[339] Ivo L. Hofacker,et al. Vienna RNA secondary structure server , 2003, Nucleic Acids Res..
[340] R. Berisio,et al. On peptide bond formation, translocation, nascent protein progression and the regulatory properties of ribosomes. Derived on 20 October 2002 at the 28th FEBS Meeting in Istanbul. , 2003, European journal of biochemistry.
[341] Elchanan Mossel. Phase transitions in phylogeny , 2003, Transactions of the American Mathematical Society.
[342] Chi Lap Yip,et al. Mining emerging substrings , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..
[343] David Sankoff,et al. The Reconstruction of Doubled Genomes , 2003, SIAM J. Comput..
[344] R. Page,et al. When do parasites fail to speciate in response to host speciation? , 2003, Systematic biology.
[345] Rolf Niedermeier,et al. An efficient fixed-parameter algorithm for 3-Hitting Set , 2003, J. Discrete Algorithms.
[346] Li Zhang,et al. On the complexity of distance-based evolutionary tree reconstruction , 2003, SODA '03.
[347] R. Beavis,et al. A method for assessing the statistical significance of mass spectrometry-based protein identifications using general scoring schemes. , 2003, Analytical chemistry.
[348] Shibu Yooseph,et al. A Survey of Computational Methods for Determining Haplotypes , 2002, Computational Methods for SNPs and Haplotype Inference.
[349] G. Chirikjian,et al. Elastic models of conformational transitions in macromolecules. , 2002, Journal of molecular graphics & modelling.
[350] Alexey I Nesvizhskii,et al. Empirical statistical model to estimate the accuracy of peptide identifications made by MS/MS and database search. , 2002, Analytical chemistry.
[351] A. Stewart,et al. TEF-1 transcription factors regulate activity of the mouse mammary tumor virus LTR. , 2002, Biochemical and biophysical research communications.
[352] G. Chirikjian,et al. Efficient generation of feasible pathways for protein conformational transitions. , 2002, Biophysical journal.
[353] H. Carlson. Protein flexibility and drug design: how to hit a moving target. , 2002, Current opinion in chemical biology.
[354] K. Katoh,et al. MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. , 2002, Nucleic acids research.
[355] Leslie M. Shaw,et al. The role of NFAT transcription factors in integrin-mediated carcinoma invasion , 2002, Nature Cell Biology.
[356] H. Berman,et al. Electronic Reprint Biological Crystallography the Protein Data Bank Biological Crystallography the Protein Data Bank , 2022 .
[357] S. Salzberg,et al. Fast algorithms for large-scale genome alignment and comparison. , 2002, Nucleic acids research.
[358] Dan Gusfield,et al. Partition-distance: A problem and class of perfect graphs arising in clustering , 2002, Inf. Process. Lett..
[359] Richard M. Karp,et al. Discovering local structure in gene expression data: the order-preserving submatrix problem , 2002, RECOMB '02.
[360] Jean-Claude Latombe,et al. Stochastic roadmap simulation: an efficient representation and algorithm for analyzing molecular motion , 2002, RECOMB '02.
[361] J. Dekker,et al. Capturing Chromosome Conformation , 2002, Science.
[362] Richard R. Hudson,et al. Generating samples under a Wright-Fisher neutral model of genetic variation , 2002, Bioinform..
[363] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.
[364] B. Oxelman,et al. Inferring the history of the polyploid Silene aegaea (Caryophyllaceae) using plastid and homoeologous nuclear DNA sequences. , 2001, Molecular phylogenetics and evolution.
[365] P. Pevzner,et al. An Eulerian path approach to DNA fragment assembly , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[366] Y. Benjamini,et al. THE CONTROL OF THE FALSE DISCOVERY RATE IN MULTIPLE TESTING UNDER DEPENDENCY , 2001 .
[367] Luca Trevisan,et al. Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.
[368] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[369] Hiroki Arimura,et al. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications , 2001, CPM.
[370] Jeremy Buhler,et al. Finding motifs using random projections , 2001, RECOMB.
[371] Nancy M. Amato,et al. Using motion planning to study protein folding pathways , 2001, J. Comput. Biol..
[372] D. Baker,et al. Prospects for ab initio protein structural genomics. , 2001, Journal of molecular biology.
[373] Giovanni Manzini,et al. An experimental study of an opportunistic index , 2001, SODA '01.
[374] D. Botstein,et al. Genomic expression programs in the response of yeast cells to environmental changes. , 2000, Molecular biology of the cell.
[375] Giovanni Manzini,et al. Opportunistic data structures with applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[376] George M. Church,et al. Biclustering of Expression Data , 2000, ISMB.
[377] Y Xu,et al. Protein threading using PROSPECT: Design and evaluation , 2000, Proteins.
[378] H. Broughton,et al. A method for including protein flexibility in protein-ligand docking: improving tools for database mining and virtual screening. , 2000, Journal of molecular graphics & modelling.
[379] Y. Peres,et al. Broadcasting on trees and the Ising model , 2000 .
[380] Bin Ma,et al. From Gene Trees to Species Trees , 2000, SIAM J. Comput..
[381] M. Ashburner,et al. Gene Ontology: tool for the unification of biology , 2000, Nature Genetics.
[382] M. Gerstein,et al. The morph server: a standardized system for analyzing and visualizing macromolecular motions in a database framework. , 2000, Nucleic acids research.
[383] Dannie Durand,et al. Notung: dating gene duplications using gene family trees , 2000, RECOMB '00.
[384] Ming-Yang Kao,et al. Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees , 2000, SIAM J. Comput..
[385] A. Klein-Szanto,et al. E2F-1: a proliferative marker of breast neoplasia. , 2000, Cancer epidemiology, biomarkers & prevention : a publication of the American Association for Cancer Research, cosponsored by the American Society of Preventive Oncology.
[386] Eugene W. Myers,et al. A whole-genome assembly of Drosophila. , 2000, Science.
[387] Bin Ma,et al. Computing similarity between RNA structures , 1999, Theor. Comput. Sci..
[388] G. Church,et al. Systematic determination of genetic network architecture , 1999, Nature Genetics.
[389] P. Erdös,et al. A Few Logs Suffice to Build (almost) All Trees: Part Ii , 2022 .
[390] P. Glasserman,et al. Asymptotically Optimal Importance Sampling and Stratification for Pricing Path‐Dependent Options , 1999 .
[391] J. Mesirov,et al. Interpreting patterns of gene expression with self-organizing maps: methods and application to hematopoietic differentiation. , 1999, Proceedings of the National Academy of Sciences of the United States of America.
[392] Hugh E. Williams,et al. Compressing Integers for Fast File Access , 1999, Comput. J..
[393] D. Botstein,et al. Cluster analysis and display of genome-wide expression patterns. , 1998, Proceedings of the National Academy of Sciences of the United States of America.
[394] P. Glasserman,et al. A large deviations perspective on the efficiency of multilevel splitting , 1998, IEEE Trans. Autom. Control..
[395] P. Kollman,et al. Pathways to a protein folding intermediate observed in a 1-microsecond simulation in aqueous solution. , 1998, Science.
[396] James W. Brown,et al. Evolutionary variation in bacterial RNase P RNAs. , 1998, Nucleic acids research.
[397] Jeanette P. Schmidt,et al. All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings , 1998, SIAM J. Comput..
[398] J. K. Townsend,et al. The theory of direct probability redistribution and its application to rare event simulation , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).
[399] S. Backert,et al. The mystery of the rings: structure and replication of mitochondrial genomes from higher plants , 1997 .
[400] K. Wüthrich,et al. Torsion angle dynamics for NMR structure calculation with the new program DYANA. , 1997, Journal of molecular biology.
[401] Ivan Hal Sudborough,et al. On the Diameter of the Pancake Network , 1997, J. Algorithms.
[402] Roland L. Dunbrack,et al. Bayesian statistical analysis of protein side‐chain rotamer preferences , 1997, Protein science : a publication of the Protein Society.
[403] Ron Shamir,et al. Faster subtree isomorphism , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[404] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[405] Andrew Rambaut,et al. Seq-Gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees , 1997, Comput. Appl. Biosci..
[406] C Kooperberg,et al. Assembly of protein tertiary structures from fragments with similar local sequences using simulated annealing and Bayesian scoring functions. , 1997, Journal of molecular biology.
[407] P Willett,et al. Development and validation of a genetic algorithm for flexible docking. , 1997, Journal of molecular biology.
[408] F. Eckstein,et al. The structure, function and application of the hammerhead ribozyme. , 1997, European journal of biochemistry.
[409] A M Gronenborn,et al. Improvements and extensions in the conformational database potential for the refinement of NMR and X-ray structures of proteins and nucleic acids. , 1997, Journal of magnetic resonance.
[410] I. Kuntz,et al. Molecular docking to ensembles of protein structures. , 1997, Journal of molecular biology.
[411] Fei Shi,et al. Suffix Arrays for Multiple Strings: A Method for On-Line Multiple String Searches , 1996, ASIAN.
[412] Boris Mirkin,et al. Mathematical Classification and Clustering , 1996 .
[413] A. Gronenborn,et al. Improving the quality of NMR and crystallographic protein structures by means of a conformational database potential derived from structure databases , 1996, Protein science : a publication of the Protein Society.
[414] Leizhen Cai,et al. Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..
[415] C. Sander,et al. Errors in protein structures , 1996, Nature.
[416] Kaizhong Zhang,et al. A constrained edit distance between unordered labeled trees , 1996, Algorithmica.
[417] M. Steel,et al. Extension Operations on Sets of Leaf-Labeled Trees , 1995 .
[418] J. Wiens,et al. Combining data sets with different numbers of taxa for phylogenetic analysis , 1995 .
[419] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[420] Pavel A. Pevzner,et al. Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[421] Pavel A. Pevzner,et al. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.
[422] K. Schleifer,et al. Phylogenetic identification and in situ detection of individual microbial cells without cultivation. , 1995, Microbiological reviews.
[423] Kaizhong Zhang,et al. Algorithms for the constrained editing distance between ordered labeled trees and related problems , 1995, Pattern Recognit..
[424] Eugene W. Myers,et al. Combinatorial algorithms for DNA sequence assembly , 1995, Algorithmica.
[425] Sampath Kannan,et al. A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed , 1995, SODA '95.
[426] J. Yates,et al. An approach to correlate tandem mass spectral data of peptides with amino acid sequences in a protein database , 1994, Journal of the American Society for Mass Spectrometry.
[427] A. Brünger,et al. Torsion angle dynamics: Reduced variable conformational sampling enhances crystallographic structure refinement , 1994, Proteins.
[428] M S Waterman,et al. Rapid and accurate estimates of statistical significance for sequence data base searches. , 1994, Proceedings of the National Academy of Sciences of the United States of America.
[429] M. Karplus,et al. How does a protein fold? , 1994, Nature.
[430] Tao Jiang,et al. Some MAX SNP-Hard Results Concerning Unordered Labeled Trees , 1994, Inf. Process. Lett..
[431] Walter Fontana,et al. Fast folding and comparison of RNA secondary structures , 1994 .
[432] David Fernández-Baca,et al. A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[433] Vineet Bafna,et al. Genome rearrangements and sorting by reversals , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[434] Eugene W. Myers,et al. Suffix arrays: a new method for on-line string searches , 1993, SODA '90.
[435] David R. Karger,et al. On approximating the longest path in a graph , 1997, Algorithmica.
[436] J. Thornton,et al. PROCHECK: a program to check the stereochemical quality of protein structures , 1993 .
[437] Michael R. Fellows,et al. Two Strikes Against Perfect Phylogeny , 1992, ICALP.
[438] Lucas Chi Kwong Hui,et al. Color Set Size Problem with Application to String Matching , 1992, CPM.
[439] M. Ragan. Phylogenetic inference based on matrix representation of trees. , 1992, Molecular phylogenetics and evolution.
[440] B. Baum. Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees , 1992 .
[441] Wojciech Szpankowski,et al. A Note on the Height of Suffix Trees , 1992, SIAM J. Comput..
[442] Ravindra K. Ahuja,et al. New scaling algorithms for the assignment and minimum mean cycle problems , 1992, Math. Program..
[443] K Wüthrich,et al. Improved efficiency of protein structure calculations from NMR data using the program DIANA with redundant dihedral angle constraints , 1991, Journal of biomolecular NMR.
[444] R. Huber,et al. Accurate Bond and Angle Parameters for X-ray Protein Structure Refinement , 1991 .
[445] C. Sander,et al. Database algorithm for generating protein backbone and side-chain co-ordinates from a C alpha trace application to model building and detection of co-ordinate errors. , 1991, Journal of molecular biology.
[446] Sampath Kannan,et al. Inferring evolutionary history from DNA sequences , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[447] M. Maes,et al. On a Cyclic String-To-String Correction Problem , 1990, Inf. Process. Lett..
[448] Kate E. Jones,et al. The delayed rise of present-day mammals , 1990, Nature.
[449] A. Clark,et al. Inference of haplotypes from PCR-amplified samples of diploid populations. , 1990, Molecular biology and evolution.
[450] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[451] K. Dill,et al. A lattice statistical mechanics model of the conformational and sequence spaces of proteins , 1989 .
[452] Robert E. Tarjan,et al. Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..
[453] Bernard Chazelle,et al. A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..
[454] E. Lander,et al. Genomic mapping by fingerprinting random clones: a mathematical analysis. , 1988, Genomics.
[455] Fanica Gavril,et al. Generating the Maximum Spanning Trees of a Weighted Graph , 1987, J. Algorithms.
[456] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .
[457] Moon-Jung Chung,et al. O(n^(2.55)) Time Algorithms for the Subgraph Homeomorphism Problem on Trees , 1987, J. Algorithms.
[458] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[459] David Sankoff,et al. COMPUTATIONAL COMPLEXITY OF INFERRING PHYLOGENIES BY COMPATIBILITY , 1986 .
[460] Luc Devroye,et al. A note on the height of binary search trees , 1986, JACM.
[461] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[462] György Turán,et al. On the succinct representation of graphs , 1984, Discret. Appl. Math..
[463] Ian H. Witten,et al. Data Compression Using Adaptive Coding and Partial String Matching , 1984, IEEE Trans. Commun..
[464] O. Gotoh. An improved algorithm for matching biological sequences. , 1982, Journal of molecular biology.
[465] H. Colonius,et al. Tree structures for proximity data , 1981 .
[466] Philip A. Bernstein,et al. Power of Natural Semijoins , 1981, SIAM J. Comput..
[467] Alfred V. Aho,et al. Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions , 1981, SIAM J. Comput..
[468] Reuven Bar-Yehuda,et al. A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.
[469] Robert E. Tarjan,et al. Storing a sparse table , 1979, CACM.
[470] G. Moore,et al. Fitting the gene lineage into its species lineage , 1979 .
[471] R. Chandrasekaran,et al. Polynomially bounded algorithms for locatingp-centers on a tree , 1978, Math. Program..
[472] James R. Walter,et al. Representations of chordal graphs as subtrees of a tree , 1978, J. Graph Theory.
[473] Mihalis Yannakakis,et al. Node-and edge-deletion NP-complete problems , 1978, STOC.
[474] Walter M. Fitch,et al. On the Problem of Discovering the Most Parsimonious Tree , 1977, The American Naturalist.
[475] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[476] Philippe G. H. Lehot. An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph , 1974, JACM.
[477] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..
[478] Peter Elias,et al. Efficient Storage and Retrieval by Content and Address of Static Files , 1974, JACM.
[479] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .
[480] Nick Roussopoulos,et al. A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C , 1973, Inf. Process. Lett..
[481] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[482] J. Hartigan. Direct Clustering of a Data Matrix , 1972 .
[483] D. Rose. Triangulated graphs and the elimination process , 1970 .
[484] H. Kahn,et al. Methods of Reducing Sample Size in Monte Carlo Computations , 1953, Oper. Res..
[485] D. Kendall. On the Generalized "Birth-and-Death" Process , 1948 .
[486] Gregor Gößler,et al. Efficient parameter search for qualitative models of regulatory networks using symbolic model checking , 2010, Bioinform..
[487] Daniel H. Huson,et al. Fast computation of minimum hybridization networks , 2012, Bioinform..
[488] Katharina T. Huber,et al. Identifying and defining trees , 2012 .
[489] Yufei Huang,et al. Biclustering of time series microarray data. , 2012, Methods in molecular biology.
[490] J. Lawrence,et al. The three-dimensional folding of the α-globin gene domain reveals formation of chromatin globules , 2011, Nature Structural &Molecular Biology.
[491] Marc A Marti-Renom,et al. The Three-dimensional Architecture of a Bacterial Genome and Its Alteration by Genetic Perturbation , 2022 .
[492] Mihai Pop,et al. Sequencing and genome assembly using next-generation technologies. , 2010, Methods in molecular biology.
[493] L. Nakhleh. Evolutionary Phylogenetic Networks: Models and Issues , 2010 .
[494] Ira M. Hall,et al. BEDTools: a flexible suite of utilities for comparing genomic features , 2010, Bioinform..
[495] I. Amit,et al. Comprehensive mapping of long-range interactions reveals folding principles of the human genome. , 2009, Science.
[496] Ali Tofigh,et al. Using Trees to Capture Reticulate Evolution : Lateral Gene Transfers and Cancer Progression , 2009 .
[497] Claude-Alain H. Roten,et al. Fast and accurate short read alignment with Burrows–Wheeler transform , 2009, Bioinform..
[498] Ruedi Aebersold,et al. The standard protein mix database: a diverse data set to assist in the production of improved Peptide and protein identification software tools. , 2008, Journal of proteome research.
[499] Miklós Csürös,et al. Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions , 2008, RECOMB-CG.
[500] A. Barabasi,et al. High-Quality Binary Protein Interaction Map of the Yeast Interactome Network , 2008, Science.
[501] Alexander F. Auch,et al. Access the most recent version at doi: 10.1101/gr.5969107 References Open Access , 2007 .
[502] J. Gatesy,et al. The supermatrix approach to systematics. , 2007, Trends in ecology & evolution.
[503] I. Rigoutsos,et al. Accurate phylogenetic classification of variable-length DNA fragments , 2007, Nature Methods.
[504] Lusheng Wang,et al. Computing the maximum similarity bi-clusters of gene expression data , 2007, Bioinform..
[505] 森下 真一,et al. Large-scale genome sequence processing , 2006 .
[506] Robert Giegerich,et al. RNAshapes: an integrated RNA analysis package based on abstract shapes. , 2006, Bioinformatics.
[507] Robert Huber,et al. Structure quality and target parameters , 2006 .
[508] Sèverine Bérard,et al. Ieee/acm Transactions on Computational Biology and Bioinformatics , 2022 .
[509] P. Evans,et al. An introduction to stereochemical restraints , 2006 .
[510] S. Falcon,et al. BIOINFORMATICS APPLICATIONS NOTE Systems biology , 2005 .
[511] Tanya Y. Berger-Wolf,et al. Combinatorial Reconstruction of Sibling Relationships , 2005 .
[512] H. Mewes,et al. The FunCat, a functional annotation scheme for systematic classification of proteins from whole genomes. , 2004, Nucleic acids research.
[513] Arlindo L. Oliveira,et al. Biclustering algorithms for biological data analysis: a survey , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[514] Mark Gerstein,et al. MolMovDB: analysis and visualization of conformational change and structural flexibility , 2003, Nucleic Acids Res..
[515] D. Haussler,et al. Human-mouse alignments with BLASTZ. , 2003, Genome research.
[516] Adrian A Canutescu,et al. Access the most recent version at doi: 10.1110/ps.03154503 References , 2003 .
[517] Bin Ma,et al. A General Edit Distance between RNA Structures , 2002, J. Comput. Biol..
[518] Minoru Kanehisa,et al. The KEGG database. , 2002, Novartis Foundation symposium.
[519] B. Berger,et al. ARACHNE: a whole-genome shotgun assembler. , 2002, Genome research.
[520] M. Csűrös. Fast recovery of evolutionary trees with thousands of nodes. , 2002, Journal of computational biology : a journal of computational molecular cell biology.
[521] Xin Chen,et al. The TRANSFAC system on gene expression regulation , 2001, Nucleic Acids Res..
[522] David Fernández-Baca,et al. The Perfect Phylogeny Problem , 2001 .
[523] R. Page. Extracting species trees from complex gene trees: reconciled trees and vertebrate phylogeny. , 2000, Molecular phylogenetics and evolution.
[524] A T Brünger,et al. Torsion-angle molecular dynamics as a new efficient tool for NMR structure calculation. , 1997, Journal of magnetic resonance.
[525] N. Guex,et al. SWISS‐MODEL and the Swiss‐Pdb Viewer: An environment for comparative protein modeling , 1997, Electrophoresis.
[526] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[527] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[528] Y. Benjamini,et al. Controlling the false discovery rate: a practical and powerful approach to multiple testing , 1995 .
[529] Eugene W. Myers,et al. Toward Simplifying and Accurately Formulating Fragment Assembly , 1995, J. Comput. Biol..
[530] Michael S. Waterman,et al. A New Algorithm for DNA Sequence Assembly , 1995, J. Comput. Biol..
[531] D. J. Wheeler,et al. A Block-sorting Lossless Data Compression Algorithm , 1994 .
[532] D. Faith. Conservation evaluation and phylogenetic diversity , 1992 .
[533] M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .
[534] Dan Gusfield,et al. Efficient algorithms for inferring evolutionary trees , 1991, Networks.
[535] J. W. Cohen,et al. QUEUEING, PERFORMANCE AND CONTROL IN ATM , 1991 .
[536] Christopher A. Meacham,et al. Theoretical and Computational Considerations of the Compatibility of Qualitative Taxonomic Characters , 1983 .
[537] Anton Kotzig,et al. Transformations of Euler Tours , 1980 .
[538] Christos H. Papadimitriou,et al. Bounds for sorting by prefix reversal , 1979, Discret. Math..
[539] F. McMorris,et al. A Mathematical Foundation for the Analysis of Cladistic Character Compatibility , 1976 .
[540] de Ng Dick Bruijn,et al. Circuits and Trees in Oriented Linear Graphs , 1951 .
[541] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[542] T. Dobzhansky,et al. Inversions in the Chromosomes of Drosophila Pseudoobscura. , 1938, Genetics.
[543] H. Whitney. Congruent Graphs and the Connectivity of Graphs , 1932 .
[544] M. Pop,et al. CORRESPONDENCE Open Access Correspondence Finishing genomes with limited resources: lessons from an ensemble of microbial genomes , 2022 .