Results 51 to 60 of about 70,442,116 (202)

Prefix Reversals on Binary and Ternary Strings [PDF]

, 2006
Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order of the first $i$ elements of $\pi$. The problem of sorting by prefix reversals (also known as pancake flipping), made famous by Gates and Papadimitriou ...
Judith Keijsper, John Tromp, Kelk, Steven, Keijsper, Judith, Tromp, J.T. (John), Stougie, L. (Leen), Hurkens, C.A.J.; id_orcid, Iersel, van, L.J.J., Tromp, John, Kelk, S.M., Tromp, J.T., Kelk, S.M. (Steven), Stougie, Leen, Hurkens, C.A.J., Hurkens, Cor; id_orcid, Hurkens, Cor, Leo van Iersel, Stougie, L., Iersel, L.J.J. (Leo) van, Van Iersel, Leo, van Iersel, L.J.J., Keijsper, J.C.M., Steven Kelk, Leen Stougie, Cor Hurkens, Hurkens, C.A.J. (Cor)   +25 more
core   +1 more source

An approximate string-matching algorithm

Theoretical Computer Science, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jong Yong Kim, John Shawe-Taylor
openaire   +1 more source

Software Library for Authorship Identification

Digital Presentation and Preservation of Cultural and Scientific Heritage, 2015
The aim of this paper is to review some methods for text authorship attribution and to discuss the development of a software library with tools for automatic authorship attribution.
Ivan Ivanov, Cvetina Hantova, Maria Nisheva, Peter L. Stanchev, Phillip Ein-Dor   +4 more
doaj   +1 more source

A Superficial Analysis Approach for Identifying Malicious Domain Names Generated by DGA Malware

IEEE Open Journal of the Communications Society, 2020
Some of the most serious security threats facing computer networks involve malware. To prevent malware-related damage, administrators must swiftly identify and remove the infected machines that may reside in their networks. However, many malware families
Akihiro Satoh, Yutaka Fukuda, Toyohiro Hayashi, Gen Kitagata   +3 more
doaj   +1 more source

Algorithms for strings and sequences: Searching motifs

, 2019
Strings, sequences and, ultimately, motifs play a key role in bioinformatics. Here, a motif is a biologically relevant pattern occurring in one or more input sequences. In this chapter, first we provide a formal definition of strings, sequences, matches,
Francesco Cauteruccio, Giorgio Terracina, Domenico Ursino, F. Cauteruccio, D. Ursino, G. Terracina   +5 more
core   +1 more source

Computability, Notation, and de re Knowledge of Numbers

Philosophies, 2022
Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of which number is the greatest common divisor of two ...
Stewart Shapiro, Eric Snyder, Richard Samuels   +2 more
doaj   +1 more source

Cosmic strings and scalar tensor gravity [PDF]

, 1999
This thesis is concerned with the study of cosmic strings. We studied the values for the Higgs mass and string coupling for which the gravitational effect of an infinite cosmic string in the context of the Einstein theory is not only locally but also ...
Da Silva, Caroline Dos Santos, Dos Santos da Silva, C.   +1 more
core  

On the Cyclic Regularities of Strings

, 2019
Part 2: 8th Mining Humanistic Data WorkshopInternational audienceRegularities in strings are often related to periods and covers, which have extensively been studied, and algorithms for their efficient computation have broad application. In this paper we
Iliopoulos, Costas, Radoszewski, Jakub, Watson, Bruce, Ajala, Oluwole Ifeanyi, Alzamel, Mai Abdulaziz M, Gao, Jia, Miznah Alshammary, Mai Alzamel, Bruce Watson, Ajala, Oluwole, Jia Gao, Alshammary, Miznah, Wojciech Rytter, Costas Iliopoulos, Jakub Radoszewski, Alshammary, Miznah Hizam, Rytter, Wojciech, Oluwole Ajala, Alzamel, Mai   +18 more
core   +1 more source

Parallel Algorithms for Encoding and Decoding Blob Code [PDF]

, 2010
A bijective code is a method for associating labeled n-trees to (n-2)-strings of node labels in such a way that different trees yield different strings and vice versa. For all known bijective codes, optimal sequential encoding and decoding algorithms are
PETRESCHI, Rossella, Rossella Petreschi, Saverio Caminiti   +2 more
core   +1 more source

String inference from longest-common-prefix array

, 2023
The suffix array, perhaps the most important data structure in modern string processing, is often augmented with the longest common prefix (LCP) array which stores the lengths of the longest common prefixes for lexicographically adjacent suffixes of a ...
Kärkkäinen, Juha, Puglisi, Simon J., Piątkowski, Marcin   +2 more
core   +1 more source