Relevant bibliographies by topics / Approximate String Matching (ASM)

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Approximate String Matching (ASM)'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Approximate String Matching (ASM).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Approximate String Matching (ASM)"

1

Liu, Bing, Dan Han, and Shuang Zhang. "Approximate Chinese String Matching Techniques Based on Pinyin Input Method." Applied Mechanics and Materials 513-517 (February 2014): 1017–20. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1017.

Full text
Abstract:
String matching is one of the most typical problems in computer science. Previous studies mainly focused on accurate string matching problem. However, with the rapid development of the computer and Internet as well as the continuously rising of new issues, people find that it has very important theoretical value and practical meaning to research and design efficient approximate string matching algorithms. Approximate string matching is also called string matching that allows errors, which mainly aims to find the pattern string in the text and database and allows k differences between the pattern string and its occurring forms in the text. For the problem of approximate string matching, though a number of algorithms have been proposed, there are fewer studies which focus on large size of alphabet . Most of experts are interested in small or middle size of alphabet . For large size of , especially for Chinese characters and Asian phonetics, there are fewer efficient algorithms. For the above reasons, this paper focuses on the approximate Chinese strings matching problem based on the pinyin input method.
APA, Harvard, Vancouver, ISO, and other styles
2

Alba, Alfonso, Martin O. Mendez, Miguel E. Rubio-Rincon, and Edgar R. Arce-Santana. "A consensus algorithm for approximate string matching and its application to QRS complex detection." International Journal of Modern Physics C 27, no. 03 (February 23, 2016): 1650029. http://dx.doi.org/10.1142/s0129183116500297.

Full text
Abstract:
In this paper, a novel algorithm for approximate string matching (ASM) is proposed. The novelty resides in the fact that, unlike most other methods, the proposed algorithm is not based on the Hamming or Levenshtein distances, but instead computes a score for each symbol in the search text based on a consensus measure. Those symbols with sufficiently high scores will likely correspond to approximate instances of the pattern string. To demonstrate the usefulness of the proposed method, it has been applied to the detection of QRS complexes in electrocardiographic signals with competitive results when compared against the classic Pan-Tompkins (PT) algorithm. The proposed method outperformed PT in 72% of the test cases, with no extra computational cost.
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Zhenglu, Jianjun Yu, and Masaru Kitsuregawa. "Fast Algorithms for Top-k Approximate String Matching." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 5, 2010): 1467–73. http://dx.doi.org/10.1609/aaai.v24i1.7527.

Full text
Abstract:
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem has increased dramatically because of the prevalence of the Web. In this paper, we aim to explore the efficient top-k similar string matching problem. Several efficient strategies are introduced, such as length aware and adaptive q-gram selection. We present a general q-gram based framework and propose two efficient algorithms based on the strategies introduced. Our techniques are experimentally evaluated on three real data sets and show a superior performance.
APA, Harvard, Vancouver, ISO, and other styles
4

Mustafa, Suleiman H. "Word-oriented approximate string matching using occurrence heuristic tables: A heuristic for searching Arabic text." Journal of the American Society for Information Science and Technology 56, no. 14 (2005): 1504–11. http://dx.doi.org/10.1002/asi.20244.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Rui, Ping Gu, and Jian Min Zeng. "A Vague Words Retrieval Method in a Relational Database." Applied Mechanics and Materials 268-270 (December 2012): 1692–96. http://dx.doi.org/10.4028/www.scientific.net/amm.268-270.1692.

Full text
Abstract:
In this paper, we propose a vague words retrieval method over text field of relational databases. This method is expected to get an ideal retrieval result from text field of relational databases when a set of incorrect keywords is submitted. The solution to this issue is: to create a “hot words library”, then let the input incorrect keywords match with the word of “hot words library”, based on the modified dynamic programming algorithm of k-difference approximate string matching. Finally, Experiments show that this solution has a good query performance.
APA, Harvard, Vancouver, ISO, and other styles
6

Baeza-Yates and G. Navarro, R. "Faster Approximate String Matching." Algorithmica 23, no. 2 (February 1999): 127–58. http://dx.doi.org/10.1007/pl00009253.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Owolabi, O., and D. R. McGregor. "Fast approximate string matching." Software: Practice and Experience 18, no. 4 (April 1988): 387–93. http://dx.doi.org/10.1002/spe.4380180407.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shang, H., and T. H. Merrettal. "Tries for approximate string matching." IEEE Transactions on Knowledge and Data Engineering 8, no. 4 (1996): 540–47. http://dx.doi.org/10.1109/69.536247.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ukkonen, Esko. "Algorithms for approximate string matching." Information and Control 64, no. 1-3 (January 1985): 100–118. http://dx.doi.org/10.1016/s0019-9958(85)80046-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Das, Shibsankar, and Kalpesh Kapoor. "Weighted approximate parameterized string matching." AKCE International Journal of Graphs and Combinatorics 14, no. 1 (April 1, 2017): 1–12. http://dx.doi.org/10.1016/j.akcej.2016.11.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Approximate String Matching (ASM)"

1

Cheng, Lok-lam, and 鄭樂霖. "Approximate string matching in DNA sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B29350591.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nguyen, Hong-Thinh. "Approximate string matching distance for image classification." Thesis, Saint-Etienne, 2014. http://www.theses.fr/2014STET4029/document.

Full text
Abstract:
L'augmentation exponentielle du nombre d'images nécessite des moyens efficaces pour les classer en fonction de leur contenu visuel. Le sac de mot visuel (Bag-Of-visual-Words, BOW), en raison de sa simplicité et de sa robustesse, devient l'approche la plus populaire. Malheureusement, cette approche ne prend pas en compte de l'information spatiale, ce qui joue un rôle important dans les catégories de modélisation d'image. Récemment, Lazebnik ont introduit la représentation pyramidale spatiale (Spatial Pyramid Representation, SPR) qui a incorporé avec succès l'information spatiale dans le modèle BOW. Néanmoins, ce système de correspondance rigide empêche la SPR de gérer les variations et les transformations d'image. L'objectif principal de cette thèse est d'étudier un modèle de chaîne de correspondance plus souple qui prend l'avantage d'histogrammes de BOW locaux et se rapproche de la correspondance de la chaîne. Notre première contribution est basée sur une représentation en chaîne et une nouvelle distance d'édition (String Matching Distance, SMD) bien adapté pour les chaînes de l'histogramme qui peut calculer efficacement par programmation dynamique. Un noyau d'édition correspondant comprenant à la fois d'une pondération et d'un système pyramidal est également dérivée. La seconde contribution est une version étendue de SMD qui remplace les opérations d'insertion et de suppression par les opérations de fusion entre les symboles successifs, ce qui apporte de la souplesse labours et correspond aux images. Toutes les distances proposées sont évaluées sur plusieurs jeux de données tâche de classification et sont comparés avec plusieurs approches concurrentes
The exponential increasing of the number of images requires efficient ways to classify them based on their visual content. The most successful and popular approach is the Bag of visual Word (BoW) representation due to its simplicity and robustness. Unfortunately, this approach fails to capture the spatial image layout, which plays an important roles in modeling image categories. Recently, Lazebnik et al (2006) introduced the Spatial Pyramid Representation (SPR) which successfully incorporated spatial information into the BoW model. The idea of their approach is to split the image into a pyramidal grid and to represent each grid cell as a BoW. Assuming that images belonging to the same class have similar spatial distributions, it is possible to use a pairwise matching as similarity measurement. However, this rigid matching scheme prevents SPR to cope with image variations and transformations. The main objective of this dissertation is to study a more flexible string matching model. Keeping the idea of local BoW histograms, we introduce a new class of edit distance to compare strings of local histograms. Our first contribution is a string based image representation model and a new edit distance (called SMD for String Matching Distance) well suited for strings composed of symbols which are local BoWs. The new distance benefits from an efficient Dynamic Programming algorithm. A corresponding edit kernel including both a weighting and a pyramidal scheme is also derived. The performance is evaluated on classification tasks and compared to the standard method and several related methods. The new method outperforms other methods thanks to its ability to detect and ignore identical successive regions inside images. Our second contribution is to propose an extended version of SMD replacing insertion and deletion operations by merging operations between successive symbols. In this approach, the number of sub regions ie. the grid divisions may vary according to the visual content. We describe two algorithms to compute this merge-based distance. The first one is a greedy version which is efficient but can produce a non optimal edit script. The other one is an optimal version but it requires a 4th degree polynomial complexity. All the proposed distances are evaluated on several datasets and are shown to outperform comparable existing methods
APA, Harvard, Vancouver, ISO, and other styles
3

Marco-Sola, Santiago. "Efficient approximate string matching techniques for sequence alignment." Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/460835.

Full text
Abstract:
One of the outstanding milestones achieved in recent years in the field of biotechnology research has been the development of high-throughput sequencing (HTS). Due to the fact that at the moment it is technically impossible to decode the genome as a whole, HTS technologies read billions of relatively short chunks of a genome at random locations. Such reads then need to be located within a reference for the species being studied (that is aligned or mapped to the genome): for each read one identifies in the reference regions that share a large sequence similarity with it, therefore indicating what the read¿s point or points of origin may be. HTS technologies are able to re-sequence a human individual (i.e. to establish the differences between his/her individual genome and the reference genome for the human species) in a very short period of time. They have also paved the way for the development of a number of new protocols and methods, leading to novel insights in genomics and biology in general. However, HTS technologies also pose a challenge to traditional data analysis methods; this is due to the sheer amount of data to be processed and the need for improved alignment algorithms that can generate accurate results quickly. This thesis tackles the problem of sequence alignment as a step within the analysis of HTS data. Its contributions focus on both the methodological aspects and the algorithmic challenges towards efficient, scalable, and accurate HTS mapping. From a methodological standpoint, this thesis strives to establish a comprehensive framework able to assess the quality of HTS mapping results. In order to be able to do so one has to understand the source and nature of mapping conflicts, and explore the accuracy limits inherent in how sequence alignment is performed for current HTS technologies. From an algorithmic standpoint, this work introduces state-of-the-art index structures and approximate string matching algorithms. They contribute novel insights that can be used in practical applications towards efficient and accurate read mapping. More in detail, first we present methods able to reduce the storage space taken by indexes for genome-scale references, while still providing fast query access in order to support effective search algorithms. Second, we describe novel filtering techniques that vastly reduce the computational requirements of sequence mapping, but are nonetheless capable of giving strict algorithmic guarantees on the completeness of the results. Finally, this thesis presents new incremental algorithmic techniques able to combine several approximate string matching algorithms; this leads to efficient and flexible search algorithms allowing the user to reach arbitrary search depths. All algorithms and methodological contributions of this thesis have been implemented as components of a production aligner, the GEM-mapper, which is publicly available, widely used worldwide and cited by a sizeable body of literature. It offers flexible and accurate sequence mapping while outperforming other HTS mappers both as to running time and to the quality of the results it produces.
Uno de los avances más importantes de los últimos años en el campo de la biotecnología ha sido el desarrollo de las llamadas técnicas de secuenciación de alto rendimiento (high-throughput sequencing, HTS). Debido a las limitaciones técnicas para secuenciar un genoma, las técnicas de alto rendimiento secuencian individualmente billones de pequeñas partes del genoma provenientes de regiones aleatorias. Posteriormente, estas pequeñas secuencias han de ser localizadas en el genoma de referencia del organismo en cuestión. Este proceso se denomina alineamiento - o mapeado - y consiste en identificar aquellas regiones del genoma de referencia que comparten una alta similaridad con las lecturas producidas por el secuenciador. De esta manera, en cuestión de horas, la secuenciación de alto rendimiento puede secuenciar un individuo y establecer las diferencias de este con el resto de la especie. En última instancia, estas tecnologías han potenciado nuevos protocolos y metodologías de investigación con un profundo impacto en el campo de la genómica, la medicina y la biología en general. La secuenciación alto rendimiento, sin embargo, supone un reto para los procesos tradicionales de análisis de datos. Debido a la elevada cantidad de datos a analizar, se necesitan nuevas y mejoradas técnicas algorítmicas que puedan escalar con el volumen de datos y producir resultados precisos. Esta tesis aborda dicho problema. Las contribuciones que en ella se realizan se enfocan desde una perspectiva metodológica y otra algorítmica que propone el desarrollo de nuevos algoritmos y técnicas que permitan alinear secuencias de manera eficiente, precisa y escalable. Desde el punto de vista metodológico, esta tesis analiza y propone un marco de referencia para evaluar la calidad de los resultados del alineamiento de secuencias. Para ello, se analiza el origen de los conflictos durante la alineación de secuencias y se exploran los límites alcanzables en calidad con las tecnologías de secuenciación de alto rendimiento. Desde el punto de vista algorítmico, en el contexto de la búsqueda aproximada de patrones, esta tesis propone nuevas técnicas algorítmicas y de diseño de índices con el objetivo de mejorar la calidad y el desempeño de las herramientas dedicadas a alinear secuencias. En concreto, esta tesis presenta técnicas de diseño de índices genómicos enfocados a obtener un acceso más eficiente y escalable. También se presentan nuevas técnicas algorítmicas de filtrado con el fin de reducir el tiempo de ejecución necesario para alinear secuencias. Y, por último, se proponen algoritmos incrementales y técnicas híbridas para combinar métodos de alineamiento y mejorar el rendimiento en búsquedas donde el error esperado es alto. Todo ello sin degradar la calidad de los resultados y con garantías formales de precisión. Para concluir, es preciso apuntar que todos los algoritmos y metodologías propuestos en esta tesis están implementados y forman parte del alineador GEM. Este versátil alineador ofrece resultados de alta calidad en entornos de producción siendo varias veces más rápido que otros alineadores. En la actualidad este software se ofrece gratuitamente, tiene una amplia comunidad de usuarios y ha sido citado en numerosas publicaciones científicas.
APA, Harvard, Vancouver, ISO, and other styles
4

Mäkinen, Veli. "Parameterized approximate string matching and local-similarity-based point-pattern matching." Helsinki : University of Helsinki, 2003. http://ethesis.helsinki.fi/julkaisut/mat/tieto/vk/makinen/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Siragusa, Enrico [Verfasser]. "Approximate string matching for high-throughput sequencing / Enrico Siragusa." Berlin : Freie Universität Berlin, 2015. http://d-nb.info/1074404882/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Keng, Leng Hui. "Approximate String Matching With Dynamic Programming and Suffix Trees." UNF Digital Commons, 2006. http://digitalcommons.unf.edu/etd/196.

Full text
Abstract:
The importance and the contribution of string matching algorithms to the modern society cannot be overstated. From basic search algorithms such as spell checking and data querying, to advanced algorithms such as DNA sequencing, trend analysis and signal processing, string matching algorithms form the foundation of many aspects in computing that have been pivotal in technological advancement. In general, string matching algorithms can be divided into the categories of exact string matching and approximate string matching. We study each area and examine some of the well known algorithms. We probe into one of the most intriguing data structure in string algorithms, the suffix tree. The lowest common ancestor extension of the suffix tree is the key to many advanced string matching algorithms. With these tools, we are able to solve string problems that were, until recently, thought intractable by many. Another interesting and relatively new data structure in string algorithms is the suffix array, which has significant breakthroughs in its linear time construction in recent years. Primarily, this thesis focuses on approximate string matching using dynamic programming and hybrid dynamic programming with suffix tree. We study both approaches in detail and see how the merger of exact string matching and approximate string matching algorithms can yield synergistic results in our experiments.
APA, Harvard, Vancouver, ISO, and other styles
7

Smith, David. "Parallel approximate string matching applied to occluded object recognition." PDXScholar, 1987. https://pdxscholar.library.pdx.edu/open_access_etds/3724.

Full text
Abstract:
This thesis develops an algorithm for approximate string matching and applies it to the problem of partially occluded object recognition. The algorithm measures the similarity of differing strings by scanning for matching substrings between strings. The length and number of matching substrings determines the amount of similarity. A classification algorithm is developed using the approximate string matching algorithm for the identification and classification of objects. A previously developed method of shape description is used for object representation.
APA, Harvard, Vancouver, ISO, and other styles
8

Dubois, Simon. "Offline Approximate String Matching forInformation Retrieval : An experiment on technical documentation." Thesis, Tekniska Högskolan, Högskolan i Jönköping, JTH. Forskningsmiljö Informationsteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-22566.

Full text
Abstract:
Approximate string matching consists in identifying strings as similar even ifthere is a number of mismatch between them. This technique is one of thesolutions to reduce the exact matching strictness in data comparison. In manycases it is useful to identify stream variation (e.g. audio) or word declension (e.g.prefix, suffix, plural). Approximate string matching can be used to score terms in InformationRetrieval (IR) systems. The benefit is to return results even if query terms doesnot exactly match indexed terms. However, as approximate string matchingalgorithms only consider characters (nor context neither meaning), there is noguarantee that additional matches are relevant matches. This paper presents the effects of some approximate string matchingalgorithms on search results in IR systems. An experimental research design hasbeen conducting to evaluate such effects from two perspectives. First, resultrelevance is analysed with precision and recall. Second, performance is measuredthanks to the execution time required to compute matches. Six approximate string matching algorithms are studied. Levenshtein andDamerau-Levenshtein computes edit distance between two terms. Soundex andMetaphone index terms based on their pronunciation. Jaccard similarity calculatesthe overlap coefficient between two strings. Tests are performed through IR scenarios regarding to different context,information need and search query designed to query on a technicaldocumentation related to software development (man pages from Ubuntu). Apurposive sample is selected to assess document relevance to IR scenarios andcompute IR metrics (precision, recall, F-Measure). Experiments reveal that all tested approximate matching methods increaserecall on average, but, except Metaphone, they also decrease precision. Soundexand Jaccard Similarity are not advised because they fail on too many IR scenarios.Highest recall is obtained by edit distance algorithms that are also the most timeconsuming. Because Levenshtein-Damerau has no significant improvementcompared to Levenshtein but costs much more time, the last one is recommendedfor use with a specialised documentation. Finally some other related recommendations are given to practitioners toimplement IR systems on technical documentation.
APA, Harvard, Vancouver, ISO, and other styles
9

Pockrandt, Christopher Maximilian [Verfasser]. "Approximate String Matching : Improving Data Structures and Algorithms / Christopher Maximilian Pockrandt." Berlin : Freie Universität Berlin, 2019. http://d-nb.info/1183675879/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Richter, Christoph Jan [Verfasser]. "Über die Vermeidung redundanter Betrachtungen beim Approximate String Matching / Christoph Jan Richter." Dortmund : Universitätsbibliothek Technische Universität Dortmund, 2005. http://d-nb.info/1011533499/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Approximate String Matching (ASM)"

1

Landau, Gad M. Efficient parallel and serial approximate string matching. New York: Courant Institute of Mathematical Sciences, New York University, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vishkin, U., and Gad M. Landau. Efficient Parallel and Serial Approximate String Matching. Creative Media Partners, LLC, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Approximate String Matching (ASM)"

1

Navarro, Gonzalo. "Approximate String Matching." In Encyclopedia of Algorithms, 102–6. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_363.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Navarro, Gonzalo. "Approximate String Matching." In Encyclopedia of Algorithms, 1–5. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_363-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Muth, Robert, and Udi Manber. "Approximate multiple string search." In Combinatorial Pattern Matching, 75–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61258-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Baeza-Yates, Ricardo, and Gonzalo Navarro. "Multiple approximate string matching." In Lecture Notes in Computer Science, 174–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63307-3_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sung, Wing-Kin. "Indexed Approximate String Matching." In Encyclopedia of Algorithms, 964–68. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_188.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sung, Wing-Kin. "Indexed Approximate String Matching." In Encyclopedia of Algorithms, 1–6. Boston, MA: Springer US, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_188-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sung, Wing-Kin. "Indexed Approximate String Matching." In Encyclopedia of Algorithms, 408–11. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_188.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Navarro, Gonzalo. "Sequential Approximate String Matching." In Encyclopedia of Algorithms, 818–20. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_363.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Russo, Luís M. S., Gonzalo Navarro, and Arlindo L. Oliveira. "Indexed Hierarchical Approximate String Matching." In String Processing and Information Retrieval, 144–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89097-3_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Baeza-Yates, Ricardo A., and Chris H. Perleberg. "Fast and practical approximate string matching." In Combinatorial Pattern Matching, 185–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56024-6_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Approximate String Matching (ASM)"

1

Huerta, Juan M. "A stack decoder approach to approximate string matching." In Proceeding of the 33rd international ACM SIGIR conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1835449.1835634.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Büch, Lutz, and Artur Andrzejak. "Approximate String Matching by End-Users using Active Learning." In CIKM'15: 24th ACM International Conference on Information and Knowledge Management. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2806416.2806453.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Masihi, Z. G., and N. M. Charkari. "Content based Video Retrieval based on Approximate String Matching." In EUROCON 2005 - The International Conference on "Computer as a Tool". IEEE, 2005. http://dx.doi.org/10.1109/eurcon.2005.1630196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Flouri, Tomáš, Kunsoo Park, Kimon Frousios, Solon P. Pissis, Costas S. Iliopoulos, and German Tischler. "Approximate string-matching with a single gap for sequence alignment." In the 2nd ACM Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2147805.2147879.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Stroe, Mihai, Radu Berinde, Cosmin Negruseri, and Dan Popovici. "An approximate string matching approach for handling incorrectly typed urls." In Proceeding of the 17th ACM conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1458082.1458268.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Landau, G. M., and U. Vishkin. "Introducing efficient parallelism into approximate string matching and a new serial algorithm." In the eighteenth annual ACM symposium. New York, New York, USA: ACM Press, 1986. http://dx.doi.org/10.1145/12130.12152.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cali, Damla Senol, Gurpreet S. Kalsi, Zulal Bingol, Can Firtina, Lavanya Subramanian, Jeremie S. Kim, Rachata Ausavarungnirun, et al. "GenASM: A High-Performance, Low-Power Approximate String Matching Acceleration Framework for Genome Sequence Analysis." In 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO). IEEE, 2020. http://dx.doi.org/10.1109/micro50266.2020.00081.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Katsumata, Akifumi, and Takao Miura. "Spatial Approximate String Matching." In 2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PacRim). IEEE, 2009. http://dx.doi.org/10.1109/pacrim.2009.5291387.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

"Approximate String Matching Techniques." In 16th International Conference on Enterprise Information Systems. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0004892802170224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Katsumata, A., T. Miura, and I. Shioya. "Approximate String Matching Using Markovian Distance." In Third International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2010). IEEE, 2010. http://dx.doi.org/10.1109/paap.2010.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Approximate String Matching (ASM)"

1

Smith, David. Parallel approximate string matching applied to occluded object recognition. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.5608.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ray, Laura, Madeleine Jordan, Steven Arcone, Lynn Kaluzienski, Benjamin Walker, Peter Ortquist Koons, James Lever, and Gordon Hamilton. Velocity field in the McMurdo shear zone from annual ground penetrating radar imaging and crevasse matching. Engineer Research and Development Center (U.S.), December 2021. http://dx.doi.org/10.21079/11681/42623.

Full text
Abstract:
The McMurdo shear zone (MSZ) is strip of heavily crevassed ice oriented in the south-north direction and moving northward. Previous airborne surveys revealed a chaotic crevasse structure superimposed on a set of expected crevasse orientations at 45 degrees to the south-north flow (due to shear stress mechanisms). The dynamics that produced this chaotic structure are poorly understood. Our purpose is to present our field methodology and provide field data that will enable validation of models of the MSZ evolution, and here, we present a method for deriving a local velocity field from ground penetrating radar (GPR) data towards that end. Maps of near-surface crevasses were derived from two annual GPR surveys of a 28 km² region of the MSZ using Eulerian sampling. Our robot-towed and GPS navigated GPR enabled a dense survey grid, with transects of the shear zone at 50 m spacing. Each survey comprised multiple crossings of long (> 1 km) crevasses that appear in echelon on the western and eastern boundaries of the shear zone, as well as two or more crossings of shorter crevasses in the more chaotic zone between the western and eastern boundaries. From these maps, we derived a local velocity field based on the year-to-year movement of the same crevasses. Our velocity field varies significantly from fields previously established using remote sensing and provides more detail than one concurrently derived from a 29-station GPS network. Rather than a simple velocity gradient expected for crevasses oriented approximately 45 degrees to flow direction, we find constant velocity contours oriented diagonally across the shear zone with a wavy fine structure. Although our survey is based on near-surface crevasses, similar crevassing found in marine ice at 160 m depth leads us to conclude that this surface velocity field may hold through the body of meteoric and marine ice. Our success with robot-towed GPR with GPS navigation suggests we may greatly increase our survey areas.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Approximate String Matching (ASM)' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography