Results 151 to 160 of about 85,734 (198)
Genome Rearrangement Shapes Prochlorococcus Ecological Adaptation [PDF]
Prochlorococcus , the most abundant and smallest known free-living photosynthetic microorganism, plays a key role in marine ecosystems and biogeochemical cycles.
Xilin Xiao, Qinglu Zeng, Nianzhi Jiao
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Genome Assembly, Rearrangement, and Repeats
Chemical Reviews, 2007AbstractChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 200 leading journals. To access a ChemInform Abstract, please click on HTML or PDF.
Haixu Tang
openaire +4 more sources
Genome Rearrangement: A Planning Approach
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that change the order of genes in a genome. Earlier Erdem and Tillier formulated the pairwise comparison of entire genomes as the problem of planning rearrangement ...
Tansel Uras, Esra Erdem 0001
openaire +2 more sources
Small RNA-mediated genome rearrangement pathways in ciliates
Most eukaryotes employ a combination of transcriptional and post-transcriptional silencing mechanisms to suppress transposons, yet ciliates employ a more extreme approach.
Yunyi Gao +2 more
exaly +2 more sources
Deep ancestry of programmed genome rearrangement in lampreys [PDF]
Vladimir A Timoshevskiy +2 more
exaly +2 more sources
Multiple Genome Rearrangement By Reversals [PDF]
In this paper, we discuss a multiple genome rearrangement problem: Given a collection of genomes represented by permutations, we generate the collection from some fixed genome, e.g., the identity permutation, in a minimum number of signed reversals. It is NP-hard, so efficient heuristics is important for finding its optimal solution.
Shiquan Wu, Xun Gu 0002
openaire +2 more sources
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2018
The weighted Genome Sorting Problem (wGSP) is to find a minimum-weight sequence of rearrangement operations that transforms a given gene order into another given gene order using rearrangement operations that are associated with a predefined weight. This paper presents a polynomial sized Integer Linear Program -called GeRe-ILP- for solving the wGSP for
Tom Hartmann +4 more
openaire +2 more sources
The weighted Genome Sorting Problem (wGSP) is to find a minimum-weight sequence of rearrangement operations that transforms a given gene order into another given gene order using rearrangement operations that are associated with a predefined weight. This paper presents a polynomial sized Integer Linear Program -called GeRe-ILP- for solving the wGSP for
Tom Hartmann +4 more
openaire +2 more sources
Parametric genome rearrangement
Gene, 1996Algorithms inspired by comparative genomics calculate an edit distance between two linear orders based on elementary edit operations such as inversion, transposition and reciprocal translocation. All operations are generally assigned the same weight, simply by default, because no systematic empirical studies exist verifying whether algorithmic outputs ...
M, Blanchette, T, Kunisawa, D, Sankoff
openaire +2 more sources
Genome architecture, rearrangements and genomic disorders
Trends in Genetics, 2002An increasing number of human diseases are recognized to result from recurrent DNA rearrangements involving unstable genomic regions. These are termed genomic disorders, in which the clinical phenotype is a consequence of abnormal dosage of gene(s) located within the rearranged genomic fragments.
Paweł, Stankiewicz, James R, Lupski
openaire +2 more sources
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing, 1996Summary: Sequence comparison in molecular biology is in the beginning of a major paradigm shift -- a shift from gene comparison based on local mutations (i.e., insertions, deletions, and substitutions of nucleotides) to chromosome comparison based on global rearrangements (i.e., inversions and transpositions of fragments).
Vineet Bafna, Pavel A. Pevzner
openaire +1 more source

