Junwei Luo

Aug 8, 2024 | peerj.com | Wenjing Chang |Mengyu Guo |Henan Polytechnic |Junwei Luo

The Boolean satisfiability (SAT) problem is a classic problem in mathematical logic, which involves determining whether there exists at least one assignment to the variables such that the given formula evaluates to true. If such an assignment exists, the SAT problem is satisfiable; otherwise, it is unsatisfiable.

Jun 30, 2023 | frontiersin.org | Min Zeng |Junwei Luo |Xingyu Liao

Lisa Fiedler1* Martin Middendorf1† Matthias Bernt2†1Department of Computer Science, Leipzig University, Leipzig, Germany2Helmholtz Centre for Environmental Research—UFZ, Leipzig, GermanyA wide range of scientific fields, such as forensics, anthropology, medicine, and molecular evolution, benefits from the analysis of mitogenomic data. With the development of new sequencing technologies, the amount of mitochondrial sequence data to be analyzed has increased exponentially over the last few years.