Abstract is missing.
- Comparative Genomics Approaches to Identifying Functionally Related GenesMichael Y. Galperin, Eugene V. Koonin. 1-24 [doi]
- A Greedy Algorithm for Hierarchical Complete Linkage ClusteringErnst Althaus, Andreas Hildebrandt, Anna Katharina Hildebrandt. 25-34 [doi]
- Vester's Sensitivity Model for Genetic Networks with Time-Discrete DynamicsLiana Amaya Moreno, Ozlem Defterli, Armin Fügenschuh, Gerhard-Wilhelm Weber. 35-46 [doi]
- Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding ProblemAnnie Chateau, Rodolphe Giroudeau. 47-58 [doi]
- Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed PermutationsThiago da Silva Arruda, Ulisses Dias, Zanoni Dias. 59-70 [doi]
- On Low Treewidth Graphs and SupertreesAlexander Grigoriev, Steven Kelk, Nela Lekic. 71-82 [doi]
- On Optimal Read Trimming in Next Generation Sequencing and Its ComplexityIvo Hedtke, Ioana M. Lemnian, Matthias Müller-Hannemann, Ivo Grosse. 83-94 [doi]
- On the Implementation of Quantitative Model RefinementBogdan Iancu, Diana-Elena Gratie, Sepinoud Azimi, Ion Petre. 95-106 [doi]
- HapMonster: A Statistically Unified Approach for Variant Calling and Haplotyping Based on Phase-Informative ReadsKaname Kojima, Naoki Nariai, Takahiro Mimori, Yumi Yamaguchi-Kabata, Yukuto Sato, Yosuke Kawai, Masao Nagasaki. 107-118 [doi]
- Mapping-Free and Assembly-Free Discovery of Inversion Breakpoints from Raw NGS ReadsClaire Lemaitre, Liviu Ciortuz, Pierre Peterlongo. 119-130 [doi]
- Modeling the Geometry of the Endoplasmic Reticulum NetworkLaurent Lemarchand, Reinhardt Euler, Congping Lin, Imogen Sparkes. 131-145 [doi]
- On Sorting of Signed Permutations by Prefix and Suffix Reversals and TranspositionsCarla Negri Lintzmayer, Zanoni Dias. 146-157 [doi]
- On the Diameter of Rearrangement ProblemsCarla Negri Lintzmayer, Zanoni Dias. 158-170 [doi]
- Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular NetworkSean Maxwell, Mark R. Chance, Mehmet Koyutürk. 171-182 [doi]
- On Algorithmic Complexity of Biomolecular Sequence Assembly ProblemGiuseppe Narzisi, Bud Mishra, Michael C. Schatz. 183-195 [doi]
- A Closed-Form Solution for Transcription Factor Activity Estimation Using Network Component AnalysisAmina Noor, Aitzaz Ahmad, Bilal Wajid, Erchin Serpedin, Mohamed N. Nounou, Hazem N. Nounou. 196-207 [doi]
- SVEM: A Structural Variant Estimation Method Using Multi-mapped Reads on BreakpointsTomohiko Ohtsuki, Naoki Nariai, Kaname Kojima, Takahiro Mimori, Yukuto Sato, Yosuke Kawai, Yumi Yamaguchi-Kabata, Testuo Shibuya, Masao Nagasaki. 208-219 [doi]
- Analysis and Classification of Constrained DNA Elements with N-gram Graphs and Genomic SignaturesDimitris Polychronopoulos, Anastasia Krithara, Christoforos Nikolaou, Georgios Paliouras, Yannis Almirantis, George Giannakopoulos. 220-234 [doi]
- Inference of Boolean Networks from Gene Interaction Graphs Using a SAT SolverDavid A. Rosenblueth, Stalin Muñoz, Miguel A. Carrillo, Eugenio Azpeitia. 235-246 [doi]
- RRCA: Ultra-Fast Multiple In-species Genome AlignmentsSebastian Wandelt, Ulf Leser. 247-261 [doi]
- Exact Protein Structure Classification Using the Maximum Contact Map Overlap MetricInken Wohlers, Mathilde Le Boudic-Jamin, Hristo Djidjev, Gunnar W. Klau, Rumen Andonov. 262-273 [doi]