Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Jaromczyk, Jerzy W."'
Shellsort is a sorting method that is attractive due to its simplicity, yet it takes effort to analyze its efficiency. The heart of the algorithm is the gap sequence chosen a priori and used during sorting. The selection of this gap sequence affects
Externí odkaz:
http://arxiv.org/abs/2301.00316
Autor:
Tapia, Andrew C.1 (AUTHOR) andrew.tapia@uky.edu, Jaromczyk, Jerzy W.1 (AUTHOR), Moore, Neil1 (AUTHOR), Schardl, Christopher L.2 (AUTHOR)
Publikováno v:
BMC Bioinformatics. 6/4/2024, Vol. 25 Issue 1, p1-33. 33p.
Autor:
Heileman, Gregory L., Free, Hayden W., Flynn, Johnny, Mackowiak, Camden, Jaromczyk, Jerzy W., Abdallah, Chaouki T.
In this research paper we describe a study that involves measuring the complexities of undergraduate curricula offered by computer science departments, and then comparing them to the quality of these departments, where quality is determined by a metr
Externí odkaz:
http://arxiv.org/abs/2006.06761
Autor:
LeFebvre, Luke1 luke.lefebvre@uky.edu, Jaromczyk, Jerzy W.1 jurek@cs.uky.edu, Kellems, Brandon N.1 bnke231@uky.edu, Tapia, Andrew C.1 andrew.tapia@uky.edu, Cahill, Maria C.1 maria.cahill@uky.edu, Cole, Averi B.1 averi.cole@uky.edu, Joo, Soohyung1 soohyung.joo@uky.edu, Garcia, Antonio R.1 antonio.garcia@uky.edu
Publikováno v:
Proceedings of the Association for Information Science & Technology. Oct2024, Vol. 61 Issue 1, p547-552. 6p.
Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Let f_k(n) denote the length of a shortest k-radius sequence over A. We provide cons
Externí odkaz:
http://arxiv.org/abs/1105.0654
Autor:
Arnaoudova, Elissaveta, Haws, David, Huggins, Peter, Jaromczyk, Jerzy W., Moore, Neil, Schardl, Chris, Yoshida, Ruriko
We propose a statistical method to test whether two phylogenetic trees with given alignments are significantly incongruent. Our method compares the two distributions of phylogenetic trees given by the input alignments, instead of comparing point esti
Externí odkaz:
http://arxiv.org/abs/1004.2101
Publikováno v:
In Journal of Combinatorial Theory, Series A 2012 119(3):731-746
Autor:
Li Weixi, Jaromczyk Jerzy W
Publikováno v:
BMC Bioinformatics, Vol 12, Iss Suppl 7, p A13 (2011)
Externí odkaz:
https://doaj.org/article/c3b5b12f58854b81b2e069624ac71517
Publikováno v:
BMC Bioinformatics, Vol 11, Iss Suppl 4, p P6 (2010)
Externí odkaz:
https://doaj.org/article/8ca3b5bbd0564b99b39b3ed0a9a4b19a
Autor:
Arnaoudova Elissaveta G, Bowens Philip J, Chui Roger G, Dinkins Randy D, Hesse Uljana, Jaromczyk Jerzy W, Martin Mitchell, Maynard Paul, Moore Neil, Schardl Chris L
Publikováno v:
BMC Bioinformatics, Vol 10, Iss Suppl 7, p A4 (2009)
Externí odkaz:
https://doaj.org/article/df1267e5ec5241d384fa5e2ab95ecaab