Search results for "type"

showing 10 items of 10618 documents

The Norway spruce genome sequence and conifer genome evolution

2013

Conifers have dominated forests for more than 200 million years and are of huge ecological and economic importance. Here we present the draft assembly of the 20-gigabase genome of Norway spruce (Picea abies), the first available for any gymnosperm. The number of well-supported genes (28,354) is similar to the >100 times smaller genome of Arabidopsis thaliana, and there is no evidence of a recent whole-genome duplication in the gymnosperm lineage. Instead, the large genome size seems to result from the slow and steady accumulation of a diverse set of long-terminal repeat transposable elements, possibly owing to the lack of an efficient elimination mechanism. Comparative sequencing of Pinu…

Transposable elementGenome evolutionRNA UntranslatedTranscription GeneticRECOMBINATIONGenomicsGENE FAMILYGenes PlantSEED PLANTSGenomeLONG NONCODING RNASSIZE VARIATIONEvolution MolecularGymnospermBotanyNaturvetenskapGene SilencingRICEPiceaGenome sizePINUSConserved SequenceWhole genome sequencingInternetMultidisciplinarybiologyTerminal Repeat SequencesBiology and Life SciencesPicea abiesGenomicsSequence Analysis DNALINEAGEbiology.organism_classificationIntronsPhenotypeDNA Transposable ElementsTRANSPOSABLE ELEMENTSORYZA-SATIVANatural SciencesGenome Plant
researchProduct

Protease-mediated processing of Argonaute proteins controls small RNA association

2020

SummarySmall RNA pathways defend the germlines of animals against selfish genetic elements and help to maintain genomic integrity. At the same time, their activity needs to be well-controlled to prevent silencing of ‘self’ genes. Here, we reveal a proteolytic mechanism that controls endogenous small interfering (22G) RNA activity in the Caenorhabditis elegans germline to protect genome integrity and maintain fertility. We find that WAGO-1 and WAGO-3 Argonaute (Ago) proteins are matured through proteolytic processing of their unusually proline-rich N-termini. In the absence of DPF-3, a P-granule-localized N-terminal dipeptidase orthologous to mammalian DPP8/9, processing fails, causing a cha…

Transposable elementSmall RNAanimal structuresDNA damageBiologyDipeptidyl peptidaseSubstrate Specificity03 medical and health sciences0302 clinical medicineAnimalsGene silencingRNA MessengerRNA Small InterferingCaenorhabditis elegansCaenorhabditis elegans ProteinsDipeptidyl-Peptidases and Tripeptidyl-PeptidasesMolecular BiologyGeneCaenorhabditis elegans030304 developmental biology0303 health sciencesWild typeRNACell BiologyArgonautebiology.organism_classificationCell biologyFertilityArgonaute ProteinsProteolysisRNA HelminthProtein Processing Post-Translational030217 neurology & neurosurgery
researchProduct

Improved heuristics for the regenerator location problem

2014

Telecommunication systems use optical signals to transmit information. The strength of a signal in an optical network deteriorates and loses power as it goes farther from the source, mainly due to attenuation. Therefore, to enable the signal to arrive its intended destination with good quality, it is necessary to regenerate the signal periodically using regenerators. These components are relatively expensive and therefore it is desirable to deploy as few of them as possible in the network. In the regenerator location problem (RLP), we are given an undirected graph, positive edge lengths, and a parameter specifying the maximum length that a signal can travel before its quality deteriorates a…

TraverseComputer scienceStrategy and ManagementReal-time computingGRASPManagement Science and Operations ResearchSignalComputer Science ApplicationsNetwork planning and designManagement of Technology and InnovationGraph (abstract data type)Node (circuits)Business and International ManagementHeuristicsAlgorithmMetaheuristicInternational Transactions in Operational Research
researchProduct

IL28B CC GENOTYPE IS ASSOCIATED WITH HIGHER ON-TREATMENT-RESPONSE RATES IN PTS WITH HCV-3: INTERIM RESULTS OF THE WRITE STUDY

2012

TreatmentPeg-InterferonGenotypeIL28B CCIL28B CC; HCV-3; Peg-InterferonWrite StudyChronic Hepatitic CHCV-3
researchProduct

Benefit of weight bosed dosoges of Ribavirin (RBV) in combinotion with Peg-lnterferon (PeglFN) a2a in naive patients with HCV2 and HCV3: results of a…

2012

TreatmentPeg-InterferonGenotypesChronic Hepatitis C
researchProduct

The genetic structure of the cosmopolitan three-partner lichenRamalina farinaceaevidences the concerted diversification of symbionts

2012

The epiphytic lichen Ramalina farinacea is distributed throughout the northern hemisphere in which the same two algal Trebouxia species (provisionally named TR1 and TR9) coexist in every thallus. Ramalina farinacea symbionts were characterized based on the two fungal nuclear loci (nrITS and rpb2 ) along with the primary and secondary structures of nrITS from each Trebouxia species in the Iberian Peninsula and Canary Islands. The results indicated a noticeable genetic differentiation between mycobionts from these two geographic areas and also suggested concerted changes in the three partners of a lichen symbiosis toward two clearly distinguishable ‘holobiont’ lineages. Modeling of ITS2 RNA s…

TrebouxiaGenotypeLichensApplied Microbiology and BiotechnologyMicrobiologyRamalina farinaceaAscomycotaChlorophytaRamalinaBotanySymbiosisLichenPhylogenyEcologybiologyEcologyGenetic Variationbiology.organism_classificationThallusEuropeHolobiontRNA RibosomalSpainGenetic structureNucleic Acid ConformationEpiphyteFEMS Microbiology Ecology
researchProduct

New insights into the OCST problem

2009

This paper considers the Euclidean variant of the optimal communciation spanning tree (OCST) problem. Researches have analyzed the structure of the problem and found that high quality solutions prefer edges of low cost. Further, edges pointing to the center of the network are more likely to be included in good solutions. We add to the literature and provide additional insights into the structure of the OCST problem. Therefore, we investigate properies of the whole tree, such as node degrees and the Wiener index. The results reveal that optimal solutions are structured in a star-like manner. There are few nodes with high node degrees, these nodes are located next to the graph's center. The m…

Tree (data structure)Mathematical optimizationeducation.field_of_studySpanning treeDegree (graph theory)Node (networking)PopulationEvolutionary algorithmGraph (abstract data type)educationAlgorithmMinimum degree spanning treeMathematicsProceedings of the 11th Annual conference on Genetic and evolutionary computation
researchProduct

A relational model for unstructured documents

1987

The logical structure of a document is usually a tree in which the order of the nodes is important at least at some level of the tree. We call a document unstructured if its structure is a single-level ordered tree. The purpose of this paper is to present a many-sorted algebra for handling unstructured documents. The documents in the model are represented by relations. An algebra for handling documents of one type can be extended to an algebra for handling documents of several types. Further, an algebra for handling documents can be extended by the relational algebra for handling documents and relations in a common algebra. The model of this paper can be regarded as a part of a general docu…

Tree (data structure)Range (mathematics)Information retrievalComputer scienceSimple (abstract algebra)Group (mathematics)Computer Science::Information RetrievalComputingMethodologies_DOCUMENTANDTEXTPROCESSINGRelational modelRelational algebraType (model theory)Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '87
researchProduct

Application of graph grammars in music composing systems

1987

Tree-adjoining grammarDevelopment environmentGraph rewritingGraph labelingRule-based machine translationComputer scienceProgramming languageClique-widthGraph (abstract data type)Context-sensitive grammarcomputer.software_genrecomputer
researchProduct

Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm

2020

In 1996, Bodlaender showed the celebrated result that an optimal tree decomposition of a graph of bounded treewidth can be found in linear time. The algorithm is based on an algorithm of Bodlaender and Kloks that computes an optimal tree decomposition given a non-optimal tree decomposition of bounded width. Both algorithms, in particular the second, are hardly accessible. We present the second algorithm in a much simpler way in this paper and refer to an extended version for the first. In our description of the second algorithm, we start by explaining how all tree decompositions of subtrees defined by the nodes of the given tree decomposition can be enumerated. We group tree decompositions …

TreewidthTree (data structure)Bounded functionGraph (abstract data type)Constant (mathematics)Equivalence classTree decompositionAlgorithmTime complexityMathematics
researchProduct