Genomic DNA frequently undergoes rearrangement of the gene order that can be localized by comparing the two DNA sequences. In mitochondrial genomes different mechanisms are likely at work, at least some of which involve the duplication of sequence around the location of the apparent breakpoints. We hypothesize that these different mechanisms of genome rearrangement leave distinctive sequence footprints. In order to study such effects it is important to locate the breakpoint positions with precision. We define a partially local sequence alignment problem that assumes that following a rearrangement of a sequence F, two fragments L, and R are produced that may exactly fit together to match F, leave a gap of deleted DNA between L and R, or overlap with each other. We show that this alignment problem can be solved by dynamic programming in cubic space and time. We apply the new method to evaluate rearrangements of animal mitogenomes and find that a surprisingly large fraction of these events involved local sequence duplications. The partially local sequence alignment method is an effective way to investigate the mechanism of genomic rearrangement events. While applied here only to mitogenomes there is no reason why the method could not be used to also consider rearrangements in nuclear genomes.

The data-flow across the internet has come to a point where the human brain is unable to read, analyze, and conclude the hidden knowledge. One way of helping people in their decisions is the classical query search and filters plugged into various available software in use. Still, the last decision is left to humans where the search for the best alternative is not provided by these queries. The need for a sort of an electronic learner has emerged. Such a type of learner has the main task of deciding for the user which preference (decision) he/she is likely to possess on the basis of other users' preferences (decisions). This field of analysis is called collaborative filtering. Learners have varied in performance and thus in acquiring results on the basis of the different algorithms involved. This article introduces the collaborative filter methods, also called recommender systems. Few publications and research have been elaborated on this topic, but the available studies are encouraging.

This paper introduces an intelligent model that combines military expertise with the latest advancements in machine learning (ML) and Geographic Information Systems (GIS) to support humanitarian demining decision-making processes, by predicting mined areas and classifying them by mine type, difficulty and priority of clearance. The model is based on direct input and validation from field decision-makers for their practical applicability and effectiveness, and accurate historical demining data extracted from military databases. With a survey polling the inputs of demining experts, 95% of the responses came with an affirmation of the potential of the model to reduce threats and increase operational efficiency. It includes military-specific factors that factor in the proximity to strategic locations as well as environmental variables like vegetation cover and terrain resolution. With Gradient Boosting algorithms such as XGBoost and LightGBM, the accuracy rate is almost 97%. Such precision levels further enhance threat assessment, better allocation of resources, and around a 30% reduction in the cost and time of conducting demining operations, signifying a strong synergy of human expertise with algorithmic precision for maximal safety and effectiveness in demining.