Algorithms on strings

Sort By:
Page 4 of 50 - About 499 essays
  • Better Essays

    Data Compression Essay

    • 2871 Words
    • 12 Pages

    with repetition, and thus are larger than they need to be. The study of data compres-sion is the science which attempts to advance toward methods that can be applied to data in order to make it take up less space. The uses for this are vast, and algorithms will need to be improved in order to sustain the inevitably larger files of the future. Thus, I

    • 2871 Words
    • 12 Pages
    Better Essays
  • Decent Essays

    What are regulatory-motifs? They are incredibly powerful strings of amino acids called promoters which help regulate whether an important gene function is turned on or off. There are thousands of motifs that have been discovered; however, understanding the specific function of a particular motif is difficult. When analyzing a DNA sequence, it is challenging to see where in the segment the motifs occur. Thanks to bioinformatics, algorithms have been developed to assist in finding motifs. A sequence

    • 1172 Words
    • 5 Pages
    Decent Essays
  • Decent Essays

    metaheuristic algorithms in optimization, including the Firefly algorithm, PSO algorithms and ABC algorithm. By implementing them in Matlab, we will use worked examples to show how each algorithm works. Firefly algorithm is an evolutionary optimization algorithm, and is inspired by the flashing behavior of special flies called fireflies in nature. There are some noisy non-linear mathematical optimization problems that can be effectively solved by Metaheuristic Algorithms. Firefly algorithm is one of

    • 1444 Words
    • 6 Pages
    Decent Essays
  • Decent Essays

    The initial one time password can be generated using an algorithm called OCRA (OATH challenge-response algorithm). OCRA is a challenge-response algorithm developed by Open Authentication (OATH) which generates a value, i.e. password with variable data input and not just incremented counter values. The variable input is a random number from the server. It is generalization of HOTP (HMAC one time password) algorithm. OCRA can be defined as: OCRA = CryptoFunction(K, DataInput) Where, K is the key shared

    • 984 Words
    • 4 Pages
    Decent Essays
  • Better Essays

    sometimes is, is the strongest link in most security chains. Our symmetric and public-key algorithms are pretty good, even though they’re not based on much rigorous mathematical theory. The real problems are elsewhere: computer security, network security, user interface and so on. “ Even quantum cryptography doesn’t “solve” all of cryptography: The keys are exchanged with photons, but a conventional mathematical algorithm takes over for the actual encryption. Conclusion Cryptography is used frequently.

    • 1146 Words
    • 5 Pages
    Better Essays
  • Decent Essays

    sides of elliptic curves. To securely transfer text and image through the network, various techniques have been developed in recent years using Elliptic Curve Cryptography [2]. S. Maria Celestin Vigila and K. Muneeswaran proposed an image encryption algorithm using ECC. They generated the values of k and nB by a random number generator, Comparative Linear Congruential Generator (CLCG) to give credibility [3]. Ali Soleymani, Md Jan Nordin, and Zulkarnain Md Ali creates a mapping table which has the intensity

    • 995 Words
    • 4 Pages
    Decent Essays
  • Better Essays

    language such as its attributes and characteristics. The language executed basic algorithmic solutions. Therefore when I created controls and data structures also finding means to express algorithms I was able to create a programing language. The variables in this projects were the stored values such as strings and integers. If I was to do this experiment in the future or expand on this experiment I would define and organize my experimental data structures differently. A programming language is an

    • 718 Words
    • 3 Pages
    Better Essays
  • Good Essays

    varies in its characteristics. Such dissimilar groups are labeled as clusters. These clusters consist of several analogous data or objects relating to a referral point [15]. Darwin 's theory inspired Genetic algorithms development. GA is evolved to resolve solution to this problem. Algorithm starts with a set of solutions (chromosomes) known as population. Outcomes from a population are taken and used to structure a new population. This is aggravated by optimism, and the new population will better

    • 2438 Words
    • 10 Pages
    Good Essays
  • Good Essays

    3.2. Heuristic detection technique This technique is also known as proactive technique. This technique is similar to signature based technique, with a difference that instead of searching for a particular signature in the code, the malware detector now searches for the commands or instructions that are not present in the application program. The result is that, here it becomes easy to detect new variants of malware that had not yet been discovered. Different heuristic analysis techniques are:

    • 1569 Words
    • 7 Pages
    Good Essays
  • Best Essays

    well judgments can mean greater functioning productivities, reduced cost and risk. In this paper we discuss about big data analysis using soft computing technique with the help of clustering approach and Differential Evolution algorithm. Index Terms—Big Data, K-means algorithm, DE (Differential Evolution), Data clustering Introduction Day by day amount of data generation is increasing in drastic manner. Where in to describe the data, for zetta byte, popular term used is “Big data”. The marvelous volume

    • 3016 Words
    • 13 Pages
    Best Essays