default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. AlCoB 2014: Tarragona, Spain
- Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe
:
Algorithms for Computational Biology - First International Conference, AlCoB 2014, Tarragona, Spain, July 1-3, 2014, Proceedigns. Lecture Notes in Computer Science 8542, Springer 2014, ISBN 978-3-319-07952-3
Invited Talks
- Michael Y. Galperin, Eugene V. Koonin:
Comparative Genomics Approaches to Identifying Functionally Related Genes. 1-24
Regular Papers
- Ernst Althaus, Andreas Hildebrandt, Anna Katharina Hildebrandt:
A Greedy Algorithm for Hierarchical Complete Linkage Clustering. 25-34 - Liana Amaya Moreno, Ozlem Defterli, Armin Fügenschuh, Gerhard-Wilhelm Weber:
Vester's Sensitivity Model for Genetic Networks with Time-Discrete Dynamics. 35-46 - Annie Chateau, Rodolphe Giroudeau:
Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem. 47-58 - Thiago da Silva Arruda, Ulisses Dias, Zanoni Dias:
Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations. 59-70 - Alexander Grigoriev, Steven Kelk, Nela Lekic:
On Low Treewidth Graphs and Supertrees. 71-82 - Ivo Hedtke, Ioana M. Lemnian, Matthias Müller-Hannemann, Ivo Grosse:
On Optimal Read Trimming in Next Generation Sequencing and Its Complexity. 83-94 - Bogdan Iancu, Diana-Elena Gratie, Sepinoud Azimi, Ion Petre:
On the Implementation of Quantitative Model Refinement. 95-106 - Kaname Kojima, Naoki Nariai, Takahiro Mimori, Yumi Yamaguchi-Kabata, Yukuto Sato, Yosuke Kawai, Masao Nagasaki:
HapMonster: A Statistically Unified Approach for Variant Calling and Haplotyping Based on Phase-Informative Reads. 107-118 - Claire Lemaitre, Liviu Ciortuz, Pierre Peterlongo:
Mapping-Free and Assembly-Free Discovery of Inversion Breakpoints from Raw NGS Reads. 119-130 - Laurent Lemarchand, Reinhardt Euler, Congping Lin, Imogen Sparkes:
Modeling the Geometry of the Endoplasmic Reticulum Network. 131-145 - Carla Negri Lintzmayer, Zanoni Dias:
On Sorting of Signed Permutations by Prefix and Suffix Reversals and Transpositions. 146-157 - Carla Negri Lintzmayer, Zanoni Dias:
On the Diameter of Rearrangement Problems. 158-170 - Sean Maxwell, Mark R. Chance, Mehmet Koyutürk:
Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular Network. 171-182 - Giuseppe Narzisi, Bud Mishra, Michael C. Schatz:
On Algorithmic Complexity of Biomolecular Sequence Assembly Problem. 183-195 - Amina Noor, Aitzaz Ahmad, Bilal Wajid, Erchin Serpedin, Mohamed N. Nounou, Hazem N. Nounou:
A Closed-Form Solution for Transcription Factor Activity Estimation Using Network Component Analysis. 196-207 - Tomohiko Ohtsuki, Naoki Nariai, Kaname Kojima, Takahiro Mimori, Yukuto Sato, Yosuke Kawai, Yumi Yamaguchi-Kabata, Tetsuo Shibuya, Masao Nagasaki:
SVEM: A Structural Variant Estimation Method Using Multi-mapped Reads on Breakpoints. 208-219 - Dimitris Polychronopoulos, Anastasia Krithara, Christoforos Nikolaou, Georgios Paliouras, Yannis Almirantis, George Giannakopoulos:
Analysis and Classification of Constrained DNA Elements with N-gram Graphs and Genomic Signatures. 220-234 - David A. Rosenblueth, Stalin Muñoz, Miguel Carrillo, Eugenio Azpeitia:
Inference of Boolean Networks from Gene Interaction Graphs Using a SAT Solver. 235-246 - Sebastian Wandelt, Ulf Leser:
RRCA: Ultra-Fast Multiple In-species Genome Alignments. 247-261 - Inken Wohlers, Mathilde Le Boudic-Jamin, Hristo N. Djidjev, Gunnar W. Klau, Rumen Andonov:
Exact Protein Structure Classification Using the Maximum Contact Map Overlap Metric. 262-273
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-02 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
