Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Variation graph“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Variation graph" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Variation graph"
Arifin, Samsul, Indra Bayu Muktyas und Jeremy Matthew Mandei. „Graph coloring program for variation of exam scheduling modeling at Binus University based on Welsh and Powell algorithm“. Journal of Physics: Conference Series 2279, Nr. 1 (01.05.2022): 012005. http://dx.doi.org/10.1088/1742-6596/2279/1/012005.
Der volle Inhalt der QuelleFirmansah, Fery. „Pelabelan Harmonis Ganjil pada Graf Bunga Double Quadrilateral“. JURNAL ILMIAH SAINS 20, Nr. 1 (10.03.2020): 12. http://dx.doi.org/10.35799/jis.20.1.2020.27278.
Der volle Inhalt der QuellePrabhakaran, Rahul, Giovanni Bertotti, Janos Urai und David Smeulders. „Investigating spatial heterogeneity within fracture networks using hierarchical clustering and graph distance metrics“. Solid Earth 12, Nr. 10 (30.09.2021): 2159–209. http://dx.doi.org/10.5194/se-12-2159-2021.
Der volle Inhalt der QuelleRautiainen, Mikko, Veli Mäkinen und Tobias Marschall. „Bit-parallel sequence-to-graph alignment“. Bioinformatics 35, Nr. 19 (09.03.2019): 3599–607. http://dx.doi.org/10.1093/bioinformatics/btz162.
Der volle Inhalt der QuelleBhat, Farooq Ahmad, und M. Arif Wani. „Elastic Bunch Graph Matching Based Face Recognition Under Varying Lighting, Pose, and Expression Conditions“. IAES International Journal of Artificial Intelligence (IJ-AI) 3, Nr. 4 (20.08.2016): 177. http://dx.doi.org/10.11591/ijai.v3.i4.pp177-182.
Der volle Inhalt der QuelleQiu, Yutong, und Carl Kingsford. „Constructing small genome graphs via string compression“. Bioinformatics 37, Supplement_1 (01.07.2021): i205—i213. http://dx.doi.org/10.1093/bioinformatics/btab281.
Der volle Inhalt der QuelleAngadi, Shanmukhappa A., und Sanjeevakumar M. Hatture. „Face Recognition Through Symbolic Modeling of Face Graphs and Texture“. International Journal of Pattern Recognition and Artificial Intelligence 33, Nr. 12 (November 2019): 1956008. http://dx.doi.org/10.1142/s0218001419560081.
Der volle Inhalt der QuelleYoussef, Maged Zakaria, und Zainab Saad Almoreed. „On odd prime labeling of graphs“. Open Journal of Discrete Applied Mathematics 3, Nr. 3 (20.10.2020): 33–40. http://dx.doi.org/10.30538/psrp-odam2020.0041.
Der volle Inhalt der QuelleKuhlmann, Marco, und Stephan Oepen. „Towards a Catalogue of Linguistic Graph Banks“. Computational Linguistics 42, Nr. 4 (Dezember 2016): 819–27. http://dx.doi.org/10.1162/coli_a_00268.
Der volle Inhalt der QuelleDa Silva, Kévin, Nicolas Pons, Magali Berland, Florian Plaza Oñate, Mathieu Almeida und Pierre Peterlongo. „StrainFLAIR: strain-level profiling of metagenomic samples using variation graphs“. PeerJ 9 (23.08.2021): e11884. http://dx.doi.org/10.7717/peerj.11884.
Der volle Inhalt der QuelleDissertationen zum Thema "Variation graph"
Kural, Deniz. „Methods for Inter- and Intra-Species Genomics for the Detection of Variation and Function“. Thesis, Boston College, 2014. http://hdl.handle.net/2345/bc-ir:104053.
Der volle Inhalt der QuelleThis thesis concerns itself with the development of methods for comparing genomes. Chapter 2 is a comparative genomics investigation of coding regions across multiple species. Regions of the genome coding for proteins show higher conservation than non-coding regions. Furthermore, we show that a portion of coding regions are conserved beyond the requirements of protein conservation, supporting functions such as microRNA binding and splicing enhancement, providing the non-coding functional impetus to conservation. In Chapter 3, we focus on the detection and characterization of a particular type of structural variation - mobile element insertions (MEIs). While there are many types of mobile elements in the human genome, three of these are active and cause most of the MEI variation observed in humans: ALU, L1 and SVA elements. We detect variation across 1000 Genomes Pilot populations caused by these elements, assemble ALU elements to single nucleotide resolution, and determine actively copying species of this element. We've developed a variety of algorithmic approaches to MEI detection, and present these. Chapter 4 outlines an approach to remedy reference bias via the incorporation of variation data into the reference. In particular, we construct a pan-genome reference, demonstrated concretely via resolving ALU regions, and develop new alignment software to align against this enriched reference structure
Thesis (PhD) — Boston College, 2014
Submitted to: Boston College. Graduate School of Arts and Sciences
Discipline: Biology
Romain, Sandra. „Identification, génotypage et représentation des variants de structure dans les pangénomes“. Electronic Thesis or Diss., Université de Rennes (2023-....), 2024. https://ged.univ-rennes1.fr/nuxeo/site/esupversions/71b8c90f-bac9-4948-9bb1-a4b6d953f322.
Der volle Inhalt der QuelleStructural variants (SVs), genomic variations of more than 50 bp, contribute significantly to genetic diversity and species evolution. Accurate detection and genotyping SVs is crucial to understanding their role in phenotypic variation and adaptation. Variation graphs (VGs) and pangenome graphs (PGs), which represent genomic variations as alternative paths in a graph, offer a promising approach for the analysis of SVs. This thesis explores the use of VGs and PGs for the detection and genotyping of SVs, focusing on a complex of four species of alpine Coenonympha butterflies. Two bioinformatics tools were developed during this thesis: (1) SVJedi-graph, the first long-read SV genotyper using a VG to represent SVs, providing a genotyping accuracy superior to state-of-the-art tools, particularly for close and overlapping SVs, and (2) INVPG-annot, a tool for identifying inversions in PGs, which demonstrated that inversions are represented by different topologies in PGs depending on the construction tool used. Comparative analysis of the Coenonympha butterfly genomes identified twelve large inversions (≥ 100 kbp) between the four species, some of which could play a role in the reproductive isolation and local adaptation of two of these species. While the PG-based approach offers advantages for genome comparison, challenges remain for the analysis of large variants such as inversions
Jaillard, Dancette Magali. „Vers une cartographie fine des polymorphismes liés à la résistance aux antimicrobiens“. Thesis, Lyon, 2018. http://www.theses.fr/2018LYSE1282/document.
Der volle Inhalt der QuelleThe emergence and spread of multi-drug resistance has become a major worldwide public health concern, calling for better understanding of the underlying resistance mechanisms. Genome-wide association studies are powerful tools to finely map the genetic polymorphism linked to the phenotypic variability observed in a population. However well documented for eukaryotic genome analysis, these studies were only recently applied to prokaryota.Through this PhD project, I searched how to better adapt these tools to the highly plastic bacterial genomes, mainly by working on the representation of the genetic variations in these genomes. Indeed, because the bacteria have the faculty to acquire genetic material by a means other than direct inheritance from a parent cell, their genomes can differ too much within a species to be aligned against a reference. A representation using sequence fragments of length k - the so-called k-mers - offers the required flexibility but generates redundancy and does not allow for a direct interpretation of the identified associations. The method we set up tests the association of these k-mers with the phenotype, and takes advantage of a De Bruijn graph (DBG) built over all genomes to remove the local redundancy of k-mers, and offer a visualisation of the genomic context of the k-mers identified by the test. This synthetic view as DBG subgraphs informs on the nature of the identified sequence: e.g. local polymorphism in a gene or gene acquired through a plasmid. The type of variant can be predicted correctly in 96% of the cases from descriptors of the subgraphs, providing a tractable framework for k-mer-based association studies
Yeo, Ronald A., Sephira G. Ryman, den Heuvel Martijn P. van, Reus Marcel A. de, Rex E. Jung, Jessica Pommy, Andrew R. Mayer et al. „Graph Metrics of Structural Brain Networks in Individuals with Schizophrenia and Healthy Controls: Group Differences, Relationships with Intelligence, and Genetics“. Cambridge University Press, 2016. https://tud.qucosa.de/id/qucosa%3A70691.
Der volle Inhalt der QuelleMeinhardt, Llopis Enric. „Morphological and statistical techniques for the analysis of 3D images“. Doctoral thesis, Universitat Pompeu Fabra, 2011. http://hdl.handle.net/10803/22719.
Der volle Inhalt der QuelleThis thesis proposes a tree data structure to encode the connected components of level sets of 3D images. This data structure is applied as a main tool in several proposed applications: 3D morphological operators, medical image visualization, analysis of color histograms, object tracking in videos and edge detection. Motivated by the problem of edge linking, the thesis contains also an study of anisotropic total variation denoising as a tool for computing anisotropic Cheeger sets. These anisotropic Cheeger sets can be used to find global optima of a class of edge linking functionals. They are also related to some affine invariant descriptors which are used in object recognition, and this relationship is laid out explicitly.
Jacob, Jobby. „Variations on graph products and vertex partitions“. Connect to this title online, 2009.
Den vollen Inhalt der Quelle findenSonnerat, Nicolas. „Galaxy cutsets and graph connectivity: variations on a theme“. Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=97002.
Der volle Inhalt der QuelleDans cette thèse, nous considerons des séparateurs dans les graphes qui peuvent être éxprimés sous forme d'une union d'ensembles de sommets dans laquelle chaque ensemble est couvert par un arbre de diamètre d-1 pour un nombre entier d ≥ 1; nous appellons ces séparateurs des galaxies séparatrices. Les galaxies séparatrices genéralisent les étoiles séparatrices et les séparateurs formés par un ensemble de sommets, et elles servent comme simple modèle pour des attaques de virus sur ou des cascades de défaillances dans un réseau, la proprieté distinguante étant que les voisins des sommets qui sont affectés peuvent eux aussi faillir. Nous approchons le sujet depuis quatre points de vue différents. Nous commençons par explorer le lien entre les galaxies et un type de flot approprié, et nous prouvons un résultat de type min max pour les graphes planaires. Ensuite, après avoir résolu la question fondamentale de reconnaitre si un graphe donné est sensible aux attaques de virus, c'est-à-dire s'il contient une galaxie séparatrice, nous introduisons des capacités dans les flots correspondants aux galaxies, et demontrons une borne d'approximabilité inférieure et supérieure de Θ(log n)pour le problème de trouver un flot maximum. Ensuite, nous enquêtons sur le problème de dessein de réseau, c'est-à-dire le problème de construire des sous-graphes couvrants peu coûteux qui ne sont pas sensibles aux cascades de défaillances. Finalement, nous nous lançons dans une analyse détaillée de la structure des étoiles séparatrices dans les graphes planaires, et nous utilisons nos résultats pour développer un algorithme polynomial qui résout le problème de neutraliser toutes les étoiles séparatrices en protégeant des arêtes.
Pandey, Arti. „Algorithmic aspects of domination and its variations“. Thesis, IIT Delhi, 2016. http://localhost:8080/xmlui/handle/12345678/7038.
Der volle Inhalt der QuelleTrillos, Nicolás Garcia. „Variational Limits of Graph Cuts on Point Clouds“. Research Showcase @ CMU, 2015. http://repository.cmu.edu/dissertations/518.
Der volle Inhalt der QuelleCouprie, Camille. „Graph-based variational optimization and applications in computer vision“. Phd thesis, Université Paris-Est, 2011. http://tel.archives-ouvertes.fr/tel-00666878.
Der volle Inhalt der QuelleBücher zum Thema "Variation graph"
Science, Lawrence Hall of, Hrsg. Equals investigations, remote rulers: A middle-school mathematics unit focusing on the relationship between algebraic graphs and graphs from real data involving direct and inverse variation. Berkeley, CA: University of California at Berkeley, 1994.
Den vollen Inhalt der Quelle findende, Werra D., und Hertz A, Hrsg. Graph colouring and variations. Amsterdam: North-Holland, 1989.
Den vollen Inhalt der Quelle findenKrishnamoorthy, Raju. Dynamics, Graph Theory, and Barsotti-Tate Groups: Variations on a Theme of Mochizuki. [New York, N.Y.?]: [publisher not identified], 2016.
Den vollen Inhalt der Quelle findenSalavessa, Isabel Maria da Costa. Graphs with parallel mean curvature and a variational problem in conformal geometry. [s.l.]: typescript, 1987.
Den vollen Inhalt der Quelle findenE, Gaines Steven, Hipskind R. Stephen, United States. National Aeronautics and Space Administration. und San Jose State University. Meteorology Dept., Hrsg. An atlas of objectively analyzed atmospheric cross sections 1973-1980. [Washington, D.C: National Aeronautics and Space Administration, 1985.
Den vollen Inhalt der Quelle findenBarg, Alexander, und O. R. Musin. Discrete geometry and algebraic combinatorics. Providence, Rhode Island: American Mathematical Society, 2014.
Den vollen Inhalt der Quelle findenSchurz, Henri, Philip J. Feinsilver, Gregory Budzban und Harry Randolph Hughes. Probability on algebraic and geometric structures: International research conference in honor of Philip Feinsilver, Salah-Eldin A. Mohammed, and Arunava Mukherjea, June 5-7, 2014, Southern Illinois University, Carbondale, Illinois. Herausgegeben von Mohammed Salah-Eldin 1946- und Mukherjea Arunava 1941-. Providence, Rhode Island: American Mathematical Society, 2016.
Den vollen Inhalt der Quelle findenLyman, R. Lee. Graphing Culture Change in North American Archaeology. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198871156.001.0001.
Der volle Inhalt der QuelleWerra, D. de, und A. Hertz. Graph Colouring and Variations. Elsevier Science & Technology Books, 1989.
Den vollen Inhalt der Quelle findenGraph Colouring and Variations. Elsevier, 1989. http://dx.doi.org/10.1016/s0167-5060(08)x7011-6.
Der volle Inhalt der QuelleBuchteile zum Thema "Variation graph"
Mitra, Susanta, und Aditya Bagchi. „Modeling Temporal Variation in Social Network: An Evolutionary Web Graph Approach“. In Handbook of Social Network Technologies and Applications, 169–84. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-7142-5_8.
Der volle Inhalt der QuelleSalim, Asif, S. S. Shiju und S. Sumitra. „Effectiveness of Representation and Length Variation of Shortest Paths in Graph Classification“. In Lecture Notes in Computer Science, 509–16. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69900-4_65.
Der volle Inhalt der QuelleSubercaseaux, Bernardo, und Marijn J. H. Heule. „The Packing Chromatic Number of the Infinite Square Grid is 15“. In Tools and Algorithms for the Construction and Analysis of Systems, 389–406. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_20.
Der volle Inhalt der QuelleAlivanistos, Dimitrios, Seth van der Bijl, Michael Cochez und Frank van Harmelen. „The Effect of Knowledge Graph Schema on Classifying Future Research Suggestions“. In Lecture Notes in Computer Science, 149–70. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-65794-8_10.
Der volle Inhalt der QuelleLodhi, Aminah Bilal, Muhammad Abdullah Bilal, Hafiz Syed Muhammad Bilal, Kifayat Ullah Khan, Fahad Ahmed Satti, Shah Khalid und Sungyoung Lee. „PNRG: Knowledge Graph-Driven Methodology for Personalized Nutritional Recommendation Generation“. In Digital Health Transformation, Smart Ageing, and Managing Disability, 230–38. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43950-6_20.
Der volle Inhalt der QuelleMüller-Olm, Markus. „5. Parallel Flow Graphs“. In Variations on Constants, 81–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11871743_5.
Der volle Inhalt der QuelleAyabe, Hiroaki, Emmanuel Manalo, Mari Fukuda und Norihiro Sadato. „What Diagrams Are Considered Useful for Solving Mathematical Word Problems in Japan?“ In Diagrammatic Representation and Inference, 79–83. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86062-2_8.
Der volle Inhalt der QuelleMahdavi, Sedigheh, Shima Khoshraftar und Aijun An. „Dynamic Joint Variational Graph Autoencoders“. In Machine Learning and Knowledge Discovery in Databases, 385–401. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43823-4_32.
Der volle Inhalt der QuelleDontchev, Asen L. „Mappings with Convex Graphs“. In Lectures on Variational Analysis, 53–59. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79911-3_6.
Der volle Inhalt der QuelleFinn, Robert. „The inclination of an H-graph“. In Calculus of Variations and Partial Differential Equations, 40–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0082884.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Variation graph"
Crowley, Daniel, Marco Dalla, Barry O'Sullivan und Andrea Visentin. „SAT Instances Generation Using Graph Variational Autoencoders“. In ESANN 2024, 369–74. Louvain-la-Neuve (Belgium): Ciaco - i6doc.com, 2024. http://dx.doi.org/10.14428/esann/2024.es2024-223.
Der volle Inhalt der QuelleShahid, Nauman, Nathanael Perraudin, Vassilis Kalofolias, Benjamin Ricaud und Pierre Vandergheynst. „PCA using graph total variation“. In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2016. http://dx.doi.org/10.1109/icassp.2016.7472562.
Der volle Inhalt der QuelleOno, Shunsuke, Isao Yamada und Itsuo Kumazawa. „Total generalized variation for graph signals“. In ICASSP 2015 - 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2015. http://dx.doi.org/10.1109/icassp.2015.7179014.
Der volle Inhalt der QuelleAhmed, H. Bay, D. Dare und A. O. Boudraa. „Graph signals classification using total variation and graph energy informations“. In 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2017. http://dx.doi.org/10.1109/globalsip.2017.8309043.
Der volle Inhalt der QuelleBerger, Peter, Manfred Buchacher, Gabor Hannak und Gerald Matz. „Graph Learning Based on Total Variation Minimization“. In ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8461603.
Der volle Inhalt der QuelleBin Wu, Xin Yang, Yi Huang und Jianbin Tan. „Analyzing temporal variation of telecom graph structure“. In China-Ireland International Conference on Information and Communications Technologies (CIICT 2008). IEE, 2008. http://dx.doi.org/10.1049/cp:20080791.
Der volle Inhalt der QuelleLi, Ying, Jing Qin, Stanley Osher und Wentai Liu. „Graph fractional-order total variation EEG source reconstruction“. In 2016 38th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC). IEEE, 2016. http://dx.doi.org/10.1109/embc.2016.7590650.
Der volle Inhalt der QuelleBai, Yuanchao, Gene Cheung, Xianming Liu und Wen Gao. „Blind Image Deblurring Via Reweighted Graph Total Variation“. In ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8462255.
Der volle Inhalt der QuelleShi, Min, Yu Huang, Xingquan Zhu, Yufei Tang, Yuan Zhuang und Jianxun Liu. „GAEN: Graph Attention Evolving Networks“. In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/213.
Der volle Inhalt der QuelleVu, Huy, Gene Cheung und Yonina C. Eldar. „Unrolling of Deep Graph Total Variation for Image Denoising“. In ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2021. http://dx.doi.org/10.1109/icassp39728.2021.9414453.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Variation graph"
Panas, R., J. Cuadra, K. Mohan und R. Morales. Model and Standard Operating Procedures Supporting Signal Variation Flow Graph Analysis. Office of Scientific and Technical Information (OSTI), September 2020. http://dx.doi.org/10.2172/1668519.
Der volle Inhalt der QuelleKriegel, Francesco. Efficient Axiomatization of OWL 2 EL Ontologies from Data by means of Formal Concept Analysis. Technische Universität Dresden, 2023. http://dx.doi.org/10.25368/2023.214.
Der volle Inhalt der QuelleHeitman, Joshua L., Alon Ben-Gal, Thomas J. Sauer, Nurit Agam und John Havlin. Separating Components of Evapotranspiration to Improve Efficiency in Vineyard Water Management. United States Department of Agriculture, März 2014. http://dx.doi.org/10.32747/2014.7594386.bard.
Der volle Inhalt der QuelleMonetary Policy Report, July 2023. Banco de la República, September 2023. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr3-2023.
Der volle Inhalt der QuelleMonetary Policy Report - January 2023. Banco de la República, Juni 2023. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr1-2023.
Der volle Inhalt der Quelle