Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Amy Wangsness Wehe"'
Autor:
Robert Logan, Zoe Fleischmann, Sofia Annis, Amy Wangsness Wehe, Jonathan L. Tilly, Dori C. Woods, Konstantin Khrapko
Publikováno v:
BMC Bioinformatics, Vol 23, Iss 1, Pp 1-18 (2022)
Abstract Background Third-generation sequencing offers some advantages over next-generation sequencing predecessors, but with the caveat of harboring a much higher error rate. Clustering-related sequences is an essential task in modern biology. To ac
Externí odkaz:
https://doaj.org/article/30ff4bd2fcb74a6aafbb02ea207905cd
Autor:
Rana Mikkelson, Sivaram K. Narayan, Dragoš Cvetković, Willem H. Haemers, Leslie Hogben, Olga Pryporova, Chris Godsil, Hein van der Holst, Sebastian M. Cioabă, Shaun M. Fallat, Francesco Barioli, Wasin So, Wayne Barrett, Kevin N. Vander Meulen, Amy Wangsness Wehe, Dragan Stevanović, Steve Butler, Irene Sciriha
Publikováno v:
Linear Algebra and Its Applications, 428(7), 1628-1648. Elsevier
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. This paper introduces a new graph paramete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a7e02412753dfcb26c6be4ff86cb6b1
https://doi.org/10.1016/j.laa.2007.10.009
https://doi.org/10.1016/j.laa.2007.10.009
Autor:
Amy Wangsness Wehe, Luz Maria DeAlba
Publikováno v:
Discrete Mathematics and Its Applications ISBN: 9781466507289
Handbook of Linear Algebra, Second Edition
Handbook of Linear Algebra, Second Edition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f16e06d12a19157520b3988f99a271a
https://doi.org/10.1201/b16113-56
https://doi.org/10.1201/b16113-56
Autor:
Hana Kim, Bokhee Im, Olga Pryporova, Jason Grout, Mary Allison, Kendrick Savage, Elizabeth Bodine, Joyati Debnath, Colin Garnett, Reshmi Nair, Bryan L. Shader, Leslie Hogben, Luz Maria DeAlba, Laura DeLoss, Amy Wangsness Wehe
Publikováno v:
Linear Algebra and its Applications. (10):2457-2472
The minimum (symmetric) rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. The problem of determining
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b6fc3278c698559009f6742f4dc9026