scholarly journals Comparative Analysis of Brute Force and Boyer Moore Algorithms in Word Suggestion Search

2021 ◽  
Vol 9 (8) ◽  
pp. 1064-1068
Keyword(s):  
Comparative Analysis ◽  
Computer System ◽  
Search Engine ◽  
Search Engines ◽  
Search Algorithm ◽  
Storage Management ◽  
Information Storage ◽  
Brute Force ◽  
Search System ◽  
Time Efficiency

The development of information that continues to develop causes an explosion of information which certainly has a very complex impact on information storage management. This also impacts on companies that have several data that continues to grow every day. Therefore, there is a needs to have a search engine algorithm that can do a search system quickly with the development of information that continues to increase every day. Search engine applications or search engines in a computer system make it easy for users to find a variety of information. To facilitate its use, search engines add search features or better known as word suggestion, which in designing this application requires string matching algorithms that can be used to solve these problems. Many strings matching algorithms are available and therefore, the need for an analysis of the search algorithm to be able to help determine which search system is appropriate for use in word suggestion search. The result comparing brute force and boyer moore algorithm, it was found that as much as 79.05% showed that the Boyer Moore algorithm has a better time efficiency compared to the Brute Force.

scholarly journals Analisis Penerapan Google Custom Search API pada Sistem Pencarian Data

2021 ◽  
Vol 1 (1) ◽  
pp. 29-35
Author(s):  
Ismail Majid
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Important Application ◽  
Search Method ◽  
Online Information ◽  
Test Results ◽  
Search System ◽  
Search Results ◽  
Information Media

Abstrak Sistem Pencarian merupakan aplikasi penting diterapkan pada sebuah media informasi online, namun sejak hadirnya mesin pencari seperti Google orang lebih suka menggunakan alat ini untuk menemukan informasi. Karena metode pencarian yang digunakan terbukti keandalannya. Apakah kita mampu seperti itu? Penelitian ini membuktikan bahwa dengan menerapkan metode Google Custom Search API, kita dapat membangun sistem pencarian layaknya seperti mesin pencari Google, hasil pengujian menunjukkan hasil pencarian yang ditampilkan sangat relevan dan rata-rata berada pada peringkat pertama. Keuntungan lainnya metode ini dilengkapi koreksi ejaan salah untuk menyempurnakan kata kunci sebenarnya.   Abstract Search system is an important application applied to an online information media, but since the presence of search engines like Google, people prefer to use this tool to find information. Because the search method used is proven to be reliable. Are we able to be like that? This research proves that by implementing the Google Custom Search API method, we can build a search system like Google's search engine, the test results show that the search results displayed are very relevant and on average are ranked first. Another advantage of this method is that it includes incorrect spelling corrections to perfect the actual keywords.

scholarly journals CRISPR-SE: a brute force search engine for CRISPR design

2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Bin Li ◽  
Poshen B Chen ◽  
Yarui Diao
Keyword(s):  
Search Engine ◽  
Sequence Alignment ◽  
Search Engines ◽  
High Performance ◽  
Design Tools ◽  
Brute Force ◽  
Guide Rnas ◽  
Speed Up ◽  
Brute Force Approach

Abstract CRISPR is a revolutionary genome-editing tool that has been broadly used and integrated within novel biotechnologies. A major component of existing CRISPR design tools is the search engines that find the off-targets up to a predefined number of mismatches. Many CRISPR design tools adapted sequence alignment tools as the search engines to speed up the process. These commonly used alignment tools include BLAST, BLAT, Bowtie, Bowtie2 and BWA. Alignment tools use heuristic algorithm to align large amount of sequences with high performance. However, due to the seed-and-extend algorithms implemented in the sequence alignment tools, these methods are likely to provide incomplete off-targets information for ultra-short sequences, such as 20-bp guide RNAs (gRNA). An incomplete list of off-targets sites may lead to erroneous CRISPR design. To address this problem, we derived four sets of gRNAs to evaluate the accuracy of existing search engines; further, we introduce a search engine, namely CRISPR-SE. CRISPR-SE is an accurate and fast search engine using a brute force approach. In CRISPR-SE, all gRNAs are virtually compared with query gRNA, therefore, the accuracies are guaranteed. We performed the accuracy benchmark with multiple search engines. The results show that as expected, alignment tools reported an incomplete and varied list of off-target sites. CRISPR-SE performs well in both accuracy and speed. CRISPR-SE will improve the quality of CRISPR design as an accurate high-performance search engine.

scholarly journals Privacy Proliferation of Customized Web Search Engine

2018 ◽  
Vol 7 (2.32) ◽  
pp. 150
Author(s):  
N Arunachalam ◽  
S Radjou ◽  
P Aravindan ◽  
T Sivagurunathan
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Information Disclosure ◽  
Web Search ◽  
User Privacy ◽  
Search System ◽  
Amount Of Information ◽  
Web Search Engine ◽  
Web Search Engines

In last few years the illegal disclosure of user privacy in web search engine has become more serious. Protecting and Pre-venting user privacy from illegal disclosure is attracting the interest among researchers in recent times. Existing web search engines do not consider the privacy of the users. Search engines tend to collect all the information from the user. A system to ensure the privacy of the user is essential. Hence, the Personalized Web Search (PWS) method was put forward to take control over the amount of information that the user can provide to the search engines. This PWS provides privacy protec-tion in web search system and minimize the information disclosure of the user related to privacy through a customizable web-search.  

scholarly journals Data, Their Relevance to Competition and Search Engines

2021 ◽  
Vol 15 (1) ◽  
pp. 119-140
Author(s):  
Rastislav Funta
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Business Models ◽  
Search Algorithm ◽  
Decisive Role ◽  
Web Pages ◽  
Abusive Behavior ◽  
Digital Business Models ◽  
User Data

A special feature of digital markets and digital business models is the high importance of (user) data. The control and the ability to analyze large amounts of data (big data) can create competitive advantage. Thus, the importance of data for the economic success of companies should be given more consideration in competition law proceedings. In search services competition, the quality factor plays a decisive role, since the expected quality of the search results determines which search engine will be used by users. Since search engines can influence the retrievability of web pages for users, preference of own search services in the web index may constitute an abusive behavior of a dominant search engine. The purpose of this paper is to provide answers on questions, among other, whether a regulation aimed at preventing abuses is necessary or whether an obligation to publish the search algorithm may be advocated.

scholarly journals The Matter of Chance: Auditing Web Search Results Related to the 2020 U.S. Presidential Primary Elections Across Six Search Engines

2021 ◽  
pp. 089443932110068
Author(s):  
Aleksandra Urman ◽  
Mykola Makhortykh ◽  
Roberto Ulloa
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Large Scale ◽  
Web Search ◽  
Primary Elections ◽  
Virtual Agents ◽  
Search Results ◽  
Presidential Primary ◽  
Large Scale Analysis ◽  
Algorithmic Information

We examine how six search engines filter and rank information in relation to the queries on the U.S. 2020 presidential primary elections under the default—that is nonpersonalized—conditions. For that, we utilize an algorithmic auditing methodology that uses virtual agents to conduct large-scale analysis of algorithmic information curation in a controlled environment. Specifically, we look at the text search results for “us elections,” “donald trump,” “joe biden,” “bernie sanders” queries on Google, Baidu, Bing, DuckDuckGo, Yahoo, and Yandex, during the 2020 primaries. Our findings indicate substantial differences in the search results between search engines and multiple discrepancies within the results generated for different agents using the same search engine. It highlights that whether users see certain information is decided by chance due to the inherent randomization of search results. We also find that some search engines prioritize different categories of information sources with respect to specific candidates. These observations demonstrate that algorithmic curation of political information can create information inequalities between the search engine users even under nonpersonalized conditions. Such inequalities are particularly troubling considering that search results are highly trusted by the public and can shift the opinions of undecided voters as demonstrated by previous research.

scholarly journals A Survey on Blockchain-Based Search Engines

2021 ◽  
Vol 11 (15) ◽  
pp. 7063
Author(s):  
Esmaeel Rezaee ◽  
Ali Mohammad Saghiri ◽  
Agostino Forestiero
Keyword(s):  
Search Engines ◽  
Research Field ◽  
The Internet ◽  
Context Aware ◽  
Search System ◽  
Search Results ◽  
Related Information ◽  
Research Article ◽  
Different Types ◽  
Search History

With the increasing growth of different types of data, search engines have become an essential tool on the Internet. Every day, billions of queries are run through few search engines with several privacy violations and monopoly problems. The blockchain, as a trending technology applied in various fields, including banking, IoT, education, etc., can be a beneficial alternative. Blockchain-based search engines, unlike monopolistic ones, do not have centralized controls. With a blockchain-based search system, no company can lay claims to user’s data or access search history and other related information. All these data will be encrypted and stored on a blockchain. Valuing users’ searches and paying them in return is another advantage of a blockchain-based search engine. Additionally, in smart environments, as a trending research field, blockchain-based search engines can provide context-aware and privacy-preserved search results. According to our research, few efforts have been made to develop blockchain use, which include studies generally in the early stages and few white papers. To the best of our knowledge, no research article has been published in this regard thus far. In this paper, a survey on blockchain-based search engines is provided. Additionally, we state that the blockchain is an essential paradigm for the search ecosystem by describing the advantages.

scholarly journals Examining and Fine-tuning the Selection of Glycan Compositions with GlyConnect Compozitor

2020 ◽  
Vol 19 (10) ◽  
pp. 1602-1618 ◽  
Author(s):  
Thibault Robin ◽  
Julien Mariethoz ◽  
Frédérique Lisacek
Keyword(s):  
Search Engine ◽  
Posttranslational Modifications ◽  
Search Engines ◽  
Web Application ◽  
Contextual Information ◽  
Fine Tuning ◽  
Data Sources ◽  
Web Interface ◽  
Definition Of ◽  
Selection Of

A key point in achieving accurate intact glycopeptide identification is the definition of the glycan composition file that is used to match experimental with theoretical masses by a glycoproteomics search engine. At present, these files are mainly built from searching the literature and/or querying data sources focused on posttranslational modifications. Most glycoproteomics search engines include a default composition file that is readily used when processing MS data. We introduce here a glycan composition visualizing and comparative tool associated with the GlyConnect database and called GlyConnect Compozitor. It offers a web interface through which the database can be queried to bring out contextual information relative to a set of glycan compositions. The tool takes advantage of compositions being related to one another through shared monosaccharide counts and outputs interactive graphs summarizing information searched in the database. These results provide a guide for selecting or deselecting compositions in a file in order to reflect the context of a study as closely as possible. They also confirm the consistency of a set of compositions based on the content of the GlyConnect database. As part of the tool collection of the Glycomics@ExPASy initiative, Compozitor is hosted at https://glyconnect.expasy.org/compozitor/ where it can be run as a web application. It is also directly accessible from the GlyConnect database.

Search Engine Update

2001 ◽  
Vol 1 (3) ◽  
pp. 28-31 ◽  
Author(s):  
Valerie Stevenson
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Search Strategy ◽  
Search Strategies ◽  
Boolean Logic ◽  
Web Searches ◽  
Search Techniques ◽  
Looking Back ◽  
The Web

Looking back to 1999, there were a number of search engines which performed equally well. I recommended defining the search strategy very carefully, using Boolean logic and field search techniques, and always running the search in more than one search engine. Numerous articles and Web columns comparing the performance of different search engines came to different conclusions on the ‘best’ search engines. Over the last year, however, all the speakers at conferences and seminars I have attended have recommended Google as their preferred tool for locating all kinds of information on the Web. I confess that I have now abandoned most of my carefully worked out search strategies and comparison tests, and use Google for most of my own Web searches.

Automatic Keyword Extraction Algorithm and Implementation

2010 ◽  
Vol 44-47 ◽  
pp. 4041-4049 ◽  
Author(s):  
Hong Zhao ◽  
Chen Sheng Bai ◽  
Song Zhu
Keyword(s):  
Search Engine ◽  
Word Frequency ◽  
Search Engines ◽  
Keyword Extraction ◽  
Web Page ◽  
C Language ◽  
Search Engine Optimization ◽  
Page Ranking ◽  
Extraction Algorithm ◽  
A Site

Search engines can bring a lot of benefit to the website. For a site, each page’s search engine ranking is very important. To make web page ranking in search engine ahead, Search engine optimization (SEO) make effect on the ranking. Web page needs to set the keywords as “keywords" to use SEO. The paper focuses on the content of a given word, and extracts the keywords of each page by calculating the word frequency. The algorithm is implemented by C # language. Keywords setting of webpage are of great importance on the information and products

Sign in / Sign up

Export Citation Format

Share Document