Artigos de revistas sobre o tema "Variation graph"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores artigos de revistas para estudos sobre o assunto "Variation graph".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja os artigos de revistas das mais diversas áreas científicas e compile uma bibliografia correta.
Arifin, Samsul, Indra Bayu Muktyas e 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, n.º 1 (1 de maio de 2022): 012005. http://dx.doi.org/10.1088/1742-6596/2279/1/012005.
Texto completo da fonteFirmansah, Fery. "Pelabelan Harmonis Ganjil pada Graf Bunga Double Quadrilateral". JURNAL ILMIAH SAINS 20, n.º 1 (10 de março de 2020): 12. http://dx.doi.org/10.35799/jis.20.1.2020.27278.
Texto completo da fontePrabhakaran, Rahul, Giovanni Bertotti, Janos Urai e David Smeulders. "Investigating spatial heterogeneity within fracture networks using hierarchical clustering and graph distance metrics". Solid Earth 12, n.º 10 (30 de setembro de 2021): 2159–209. http://dx.doi.org/10.5194/se-12-2159-2021.
Texto completo da fonteRautiainen, Mikko, Veli Mäkinen e Tobias Marschall. "Bit-parallel sequence-to-graph alignment". Bioinformatics 35, n.º 19 (9 de março de 2019): 3599–607. http://dx.doi.org/10.1093/bioinformatics/btz162.
Texto completo da fonteBhat, Farooq Ahmad, e 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, n.º 4 (20 de agosto de 2016): 177. http://dx.doi.org/10.11591/ijai.v3.i4.pp177-182.
Texto completo da fonteQiu, Yutong, e Carl Kingsford. "Constructing small genome graphs via string compression". Bioinformatics 37, Supplement_1 (1 de julho de 2021): i205—i213. http://dx.doi.org/10.1093/bioinformatics/btab281.
Texto completo da fonteAngadi, Shanmukhappa A., e Sanjeevakumar M. Hatture. "Face Recognition Through Symbolic Modeling of Face Graphs and Texture". International Journal of Pattern Recognition and Artificial Intelligence 33, n.º 12 (novembro de 2019): 1956008. http://dx.doi.org/10.1142/s0218001419560081.
Texto completo da fonteYoussef, Maged Zakaria, e Zainab Saad Almoreed. "On odd prime labeling of graphs". Open Journal of Discrete Applied Mathematics 3, n.º 3 (20 de outubro de 2020): 33–40. http://dx.doi.org/10.30538/psrp-odam2020.0041.
Texto completo da fonteKuhlmann, Marco, e Stephan Oepen. "Towards a Catalogue of Linguistic Graph Banks". Computational Linguistics 42, n.º 4 (dezembro de 2016): 819–27. http://dx.doi.org/10.1162/coli_a_00268.
Texto completo da fonteDa Silva, Kévin, Nicolas Pons, Magali Berland, Florian Plaza Oñate, Mathieu Almeida e Pierre Peterlongo. "StrainFLAIR: strain-level profiling of metagenomic samples using variation graphs". PeerJ 9 (23 de agosto de 2021): e11884. http://dx.doi.org/10.7717/peerj.11884.
Texto completo da fonteBigham, Abigail, Elizabeth Ann Donovan, James Pack, Jordan Turley e Lesley Wiglesworth. "Prime Labelings of Snake Graphs". PUMP Journal of Undergraduate Research 2 (21 de agosto de 2019): 131–49. http://dx.doi.org/10.46787/pump.v2i0.1274.
Texto completo da fonteJain, Chirag, Neda Tavakoli e Srinivas Aluru. "A variant selection framework for genome graphs". Bioinformatics 37, Supplement_1 (1 de julho de 2021): i460—i467. http://dx.doi.org/10.1093/bioinformatics/btab302.
Texto completo da fonteBenediktovich, V. I. "Analogue of Brauer’s conjecture for the signless Laplacian of cographs". Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series 56, n.º 3 (18 de outubro de 2020): 310–17. http://dx.doi.org/10.29235/1561-2430-2020-56-3-310-317.
Texto completo da fonteLiu, Feng, e Xiao Zhang. "Variation Inequalities for the Hardy-Littlewood Maximal Function on Finite Directed Graphs". Mathematics 10, n.º 6 (16 de março de 2022): 950. http://dx.doi.org/10.3390/math10060950.
Texto completo da fonteKaruza, Elisabeth A., Ari E. Kahn e Danielle S. Bassett. "Human Sensitivity to Community Structure Is Robust to Topological Variation". Complexity 2019 (11 de fevereiro de 2019): 1–8. http://dx.doi.org/10.1155/2019/8379321.
Texto completo da fonteMeinawati, Rima, Vika Yugi Kurniawan e Nughthoh Arfawi Kurdhi. "Algorithm for Constructing Total Graph of Commutative Ring". JTAM (Jurnal Teori dan Aplikasi Matematika) 8, n.º 2 (30 de março de 2024): 351. http://dx.doi.org/10.31764/jtam.v8i2.19850.
Texto completo da fonteChen, Hanlin, Renfang Wu, Guihua Huang e Hanyuan Deng. "Dimer–monomer model on the Towers of Hanoi graphs". International Journal of Modern Physics B 29, n.º 23 (17 de setembro de 2015): 1550173. http://dx.doi.org/10.1142/s0217979215501738.
Texto completo da fonteChristensen, Andrew J., Ananya Sen Gupta e Ivars Kirsteins. "Graph representation learning on braid manifolds". Journal of the Acoustical Society of America 152, n.º 4 (outubro de 2022): A39. http://dx.doi.org/10.1121/10.0015466.
Texto completo da fonteTang, Xiangyun, Dongliang Liao, Weijie Huang, Jin Xu, Liehuang Zhu e Meng Shen. "Fully Exploiting Cascade Graphs for Real-time Forwarding Prediction". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 1 (18 de maio de 2021): 582–90. http://dx.doi.org/10.1609/aaai.v35i1.16137.
Texto completo da fonteCaselli, A., G. Falquet e C. Métral. "KNOWLEDGE GRAPH CONSTRUCTION FOR SUBSURFACE OBJECTS INCLUDING UNCERTAINTY AND TIME VARIATION". International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLVI-4/W4-2021 (7 de outubro de 2021): 131–36. http://dx.doi.org/10.5194/isprs-archives-xlvi-4-w4-2021-131-2021.
Texto completo da fonteMo, Yujie, Liang Peng, Jie Xu, Xiaoshuang Shi e Xiaofeng Zhu. "Simple Unsupervised Graph Representation Learning". Proceedings of the AAAI Conference on Artificial Intelligence 36, n.º 7 (28 de junho de 2022): 7797–805. http://dx.doi.org/10.1609/aaai.v36i7.20748.
Texto completo da fonteKo, Eun-Sung. "A study on teaching of reasoning about variation: Focusing on statistics unit in 3rd and 4th grade of elementary school". Korean Association For Learner-Centered Curriculum And Instruction 23, n.º 12 (30 de junho de 2023): 733–49. http://dx.doi.org/10.22251/jlcci.2023.23.12.733.
Texto completo da fonteChang, Xian, Jordan Eizenga, Adam M. Novak, Jouni Sirén e Benedict Paten. "Distance indexing and seed clustering in sequence graphs". Bioinformatics 36, Supplement_1 (1 de julho de 2020): i146—i153. http://dx.doi.org/10.1093/bioinformatics/btaa446.
Texto completo da fonteOggier, Frédérique, e Anwitaman Datta. "Renyi entropy driven hierarchical graph clustering". PeerJ Computer Science 7 (25 de fevereiro de 2021): e366. http://dx.doi.org/10.7717/peerj-cs.366.
Texto completo da fonteKo, Sung Moon, Sungjun Cho, Dae-Woong Jeong, Sehui Han, Moontae Lee e Honglak Lee. "Grouping Matrix Based Graph Pooling with Adaptive Number of Clusters". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 7 (26 de junho de 2023): 8334–42. http://dx.doi.org/10.1609/aaai.v37i7.26005.
Texto completo da fonteMartynov, N. N., O. V. Khandarova e F. V. Khandarov. "Graph Clustering Based on Modularity Variation Estimations". Bulletin of Irkutsk State University. Series Mathematics 25 (2018): 63–78. http://dx.doi.org/10.26516/1997-7670.2018.25.63.
Texto completo da fonteShetty, Archana, Shubha H. V. Shubha H V, Vijaya Chowdappa e Vivek T. G. Vivek T G. "A Study of Variation in Adult Thrombocytopenic Histograms A Graph Often Overlooked". Annals of Pathology and Laboratory Medicine 7, n.º 2 (7 de março de 2020): A83–88. http://dx.doi.org/10.21276/apalm.2665.
Texto completo da fonteLiu, Jianxi. "On the variation of the Randic index with given girth and leaves". Filomat 28, n.º 9 (2014): 1849–53. http://dx.doi.org/10.2298/fil1409849l.
Texto completo da fonteQu, Ruyuan, Hui Feng, Chongbin Xu e Bo Hu. "Analysis of Hypergraph Signals via High-Order Total Variation". Symmetry 14, n.º 3 (7 de março de 2022): 543. http://dx.doi.org/10.3390/sym14030543.
Texto completo da fonteFirmansah, Fery. "The Odd Harmonious Labeling on Variation of the Double Quadrilateral Windmill Graphs". Jurnal ILMU DASAR 18, n.º 2 (26 de outubro de 2017): 109. http://dx.doi.org/10.19184/jid.v18i2.5648.
Texto completo da fonteBiederstedt, Evan, Jeffrey C. Oliver, Nancy F. Hansen, Aarti Jajoo, Nathan Dunn, Andrew Olson, Ben Busby e Alexander T. Dilthey. "NovoGraph: Genome graph construction from multiple long-read de novo assemblies". F1000Research 7 (3 de setembro de 2018): 1391. http://dx.doi.org/10.12688/f1000research.15895.1.
Texto completo da fonteBiederstedt, Evan, Jeffrey C. Oliver, Nancy F. Hansen, Aarti Jajoo, Nathan Dunn, Andrew Olson, Ben Busby e Alexander T. Dilthey. "NovoGraph: Human genome graph construction from multiple long-read de novo assemblies". F1000Research 7 (10 de dezembro de 2018): 1391. http://dx.doi.org/10.12688/f1000research.15895.2.
Texto completo da fonteAckerman, Nate, Cameron E. Freer, Younesse Kaddar, Jacek Karwowski, Sean Moss, Daniel Roy, Sam Staton e Hongseok Yang. "Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets". Proceedings of the ACM on Programming Languages 8, POPL (5 de janeiro de 2024): 1819–49. http://dx.doi.org/10.1145/3632903.
Texto completo da fonteChristensen, Andrew J., Ananya Sen Gupta e Ivars Kirsteins. "Sonar target feature representation using temporal graph networks". Journal of the Acoustical Society of America 151, n.º 4 (abril de 2022): A102. http://dx.doi.org/10.1121/10.0010791.
Texto completo da fonteHe, Ya Feng, Qing Yu e You Ming Wang. "Topological Synthesis of Planetary Gear Trains". Applied Mechanics and Materials 33 (outubro de 2010): 43–50. http://dx.doi.org/10.4028/www.scientific.net/amm.33.43.
Texto completo da fonteAldous, David. "Hitting times for random walks on vertex-transitive graphs". Mathematical Proceedings of the Cambridge Philosophical Society 106, n.º 1 (julho de 1989): 179–91. http://dx.doi.org/10.1017/s0305004100068079.
Texto completo da fonteGomez-Pilar, Javier, Jesús Poza, Alejandro Bachiller, Carlos Gómez, Pablo Núñez, Alba Lubeiro, Vicente Molina e Roberto Hornero. "Quantification of Graph Complexity Based on the Edge Weight Distribution Balance: Application to Brain Networks". International Journal of Neural Systems 28, n.º 01 (20 de dezembro de 2017): 1750032. http://dx.doi.org/10.1142/s0129065717500320.
Texto completo da fonteMahmood, Faisal, Nauman Shahid, Ulf Skoglund e Pierre Vandergheynst. "Adaptive Graph-Based Total Variation for Tomographic Reconstructions". IEEE Signal Processing Letters 25, n.º 5 (maio de 2018): 700–704. http://dx.doi.org/10.1109/lsp.2018.2816582.
Texto completo da fonteMANUEL, PAUL, e SANDI KLAVŽAR. "A GENERAL POSITION PROBLEM IN GRAPH THEORY". Bulletin of the Australian Mathematical Society 98, n.º 2 (18 de julho de 2018): 177–87. http://dx.doi.org/10.1017/s0004972718000473.
Texto completo da fonteAnshar, Muhammad, Raden Sumiharto e Moh Edi Wibowo. "Progressive Content Generation Based on Cyclic Graph for Generate Dungeon". IJCCS (Indonesian Journal of Computing and Cybernetics Systems) 17, n.º 1 (23 de fevereiro de 2023): 91. http://dx.doi.org/10.22146/ijccs.81178.
Texto completo da fonteGEUVERS, HERMAN, e IRIS LOEB. "Natural deduction via graphs: formal definition and computation rules". Mathematical Structures in Computer Science 17, n.º 3 (junho de 2007): 485–526. http://dx.doi.org/10.1017/s0960129507006123.
Texto completo da fonteGhaffaari, Ali, e Tobias Marschall. "Fully-sensitive seed finding in sequence graphs using a hybrid index". Bioinformatics 35, n.º 14 (julho de 2019): i81—i89. http://dx.doi.org/10.1093/bioinformatics/btz341.
Texto completo da fonteIršič, Vesna, e Sandi Klavžar. "Strong geodetic problem on Cartesian products of graphs". RAIRO - Operations Research 52, n.º 1 (janeiro de 2018): 205–16. http://dx.doi.org/10.1051/ro/2018003.
Texto completo da fonteCarswell, C. Melody, e Cathy Emery. "Effects of Stimulus Complexity and Cognitive Style on Spontaneous Interpretations of Line Graphs". Proceedings of the Human Factors Society Annual Meeting 36, n.º 18 (outubro de 1992): 1498–502. http://dx.doi.org/10.1177/154193129203601829.
Texto completo da fonteGarrison, Erik, Jouni Sirén, Adam M. Novak, Glenn Hickey, Jordan M. Eizenga, Eric T. Dawson, William Jones et al. "Variation graph toolkit improves read mapping by representing genetic variation in the reference". Nature Biotechnology 36, n.º 9 (outubro de 2018): 875–79. http://dx.doi.org/10.1038/nbt.4227.
Texto completo da fonteSudbø, J., R. Marcelpoil e A. Reith. "Caveats: Numerical Requirements in Graph Theory Based Quantitation of Tissue Architecture". Analytical Cellular Pathology 21, n.º 2 (2000): 59–69. http://dx.doi.org/10.1155/2000/438202.
Texto completo da fonteUmilasari, Reni, Ilham Saifudin e Isnawati Lujeng Lestari. "Star metric dimension of complete, bipartite, complete bipartite and fan graphs". International Journal of Trends in Mathematics Education Research 5, n.º 2 (30 de junho de 2022): 199–205. http://dx.doi.org/10.33122/ijtmer.v5i2.137.
Texto completo da fonteBlinova, I. V., A. S. Gnedash e I. Y. Popov. "A time-dependent metric graph with a fourth-order operator on the edges". Theoretical and Applied Mechanics 48, n.º 2 (2021): 187–200. http://dx.doi.org/10.2298/tam200928007b.
Texto completo da fontevan Gennip, Yves. "An MBO Scheme for Minimizing the Graph Ohta–Kawasaki Functional". Journal of Nonlinear Science 30, n.º 5 (1 de junho de 2018): 2325–73. http://dx.doi.org/10.1007/s00332-018-9468-8.
Texto completo da fonteHAMID, I. SAHUL, e MAYAMMA JOSEPH. "FURTHER RESULTS ON INDUCED GRAPHOIDAL DECOMPOSITION". Discrete Mathematics, Algorithms and Applications 05, n.º 01 (março de 2013): 1350006. http://dx.doi.org/10.1142/s1793830913500067.
Texto completo da fonte