[图书][B] Combinatorics of genome rearrangements
G Fertin - 2009 - books.google.com
A comprehensive survey of a rapidly expanding field of combinatorial optimization,
mathematically oriented but offering biological explanations when required. From one cell to …
mathematically oriented but offering biological explanations when required. From one cell to …
Development of an indoor navigation system using NFC technology
B Ozdenizci, K Ok, V Coskun… - 2011 Fourth International …, 2011 - ieeexplore.ieee.org
Existing indoor navigation systems face with many different technical and usability problems.
In this paper we present a Near Field Communication (NFC) based indoor navigation …
In this paper we present a Near Field Communication (NFC) based indoor navigation …
[PDF][PDF] On the traveling salesman problem with simple temporal constraints
Many real-world applications require the successful combination of spatial and temporal
reasoning. In this paper, we study the general framework of the Traveling Salesman …
reasoning. In this paper, we study the general framework of the Traveling Salesman …
Faster exact maximum parsimony search with XMP
WTJ White, BR Holland - Bioinformatics, 2011 - academic.oup.com
Motivation: Despite trends towards maximum likelihood and Bayesian criteria, maximum
parsimony (MP) remains an important criterion for evaluating phylogenetic trees. Because …
parsimony (MP) remains an important criterion for evaluating phylogenetic trees. Because …
Gene order rearrangement methods for the reconstruction of phylogeny
M Bernt - 2010 - ul.qucosa.de
Abstract (EN) The study of phylogeny, ie the evolutionary history of species, is a central
problem in biology and a key for understanding characteristics of contemporary species …
problem in biology and a key for understanding characteristics of contemporary species …
Phylogenetic reconstruction from complete gene orders of whole genomes
KM Swenson, W Arndt, J Tang… - Proceedings Of The 6th …, 2008 - World Scientific
Rapidly increasing numbers of organisms have been completely sequenced and most of
their genes identified; homologies among these genes are also getting established. It thus …
their genes identified; homologies among these genes are also getting established. It thus …
An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
Given an arc-weighted directed graph G=(V, A, ℓ) and a pair of vertices s, t, we seek to find
an s-twalk of minimum length that visits all the vertices in V. If ℓ satisfies the asymmetric …
an s-twalk of minimum length that visits all the vertices in V. If ℓ satisfies the asymmetric …
Sagl: A new heuristic for multi-robot routing with complex tasks
In this paper, we study the Complex Routing Problem (CRP), where several homogeneous
robots need to visit given task locations to accomplish complex tasks in a cooperative …
robots need to visit given task locations to accomplish complex tasks in a cooperative …
[PDF][PDF] for Genome Rearrangements
J Ková - 2013 - compbio.fmph.uniba.sk
Introductory example. One of the first things a future computer scientist learns is how to sort a
sequence of numbers efficiently (Knuth, 1973). Now imagine that we are reordering heavy …
sequence of numbers efficiently (Knuth, 1973). Now imagine that we are reordering heavy …