Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:( substring). Showing records 1 – 9 of 9 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Wright State University

1. Patel, Chandankumar Johakhim. A Performance Analysis Framework for Coreference Resolution Algorithms.

Degree: MS, Computer Science, 2016, Wright State University

 This thesis entitled A Performance Analysis Framework for Coreference Resolution Algorithms, focuses on the topic of coreference resolution of semantic datasets. In order for Big… (more)

Subjects/Keywords: Computer Science; Computer Engineering; Coreference; Levenshtein; LCS; OWL; RDF; longest common substring; jaro; winkler

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Patel, C. J. (2016). A Performance Analysis Framework for Coreference Resolution Algorithms. (Masters Thesis). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1471954403

Chicago Manual of Style (16th Edition):

Patel, Chandankumar Johakhim. “A Performance Analysis Framework for Coreference Resolution Algorithms.” 2016. Masters Thesis, Wright State University. Accessed October 22, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1471954403.

MLA Handbook (7th Edition):

Patel, Chandankumar Johakhim. “A Performance Analysis Framework for Coreference Resolution Algorithms.” 2016. Web. 22 Oct 2019.

Vancouver:

Patel CJ. A Performance Analysis Framework for Coreference Resolution Algorithms. [Internet] [Masters thesis]. Wright State University; 2016. [cited 2019 Oct 22]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1471954403.

Council of Science Editors:

Patel CJ. A Performance Analysis Framework for Coreference Resolution Algorithms. [Masters Thesis]. Wright State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1471954403


NSYSU

2. Tseng, Chiou-Ting. Variants of the Constrained Longest Common and Longest Increasing Subsequence Problems.

Degree: PhD, Computer Science and Engineering, 2013, NSYSU

 Given two strings A = a1a2a3...am and B = b1b2b3...bn, the longest common subsequence (LCS) problem is that of finding the longest common part of… (more)

Subjects/Keywords: design of algorithms; bioinformatics; longest common subsequence; finite automata; sequential substring; height; longest increasing subsequence; NP-hard; constrained LCS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tseng, C. (2013). Variants of the Constrained Longest Common and Longest Increasing Subsequence Problems. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720113-163337

Chicago Manual of Style (16th Edition):

Tseng, Chiou-Ting. “Variants of the Constrained Longest Common and Longest Increasing Subsequence Problems.” 2013. Doctoral Dissertation, NSYSU. Accessed October 22, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720113-163337.

MLA Handbook (7th Edition):

Tseng, Chiou-Ting. “Variants of the Constrained Longest Common and Longest Increasing Subsequence Problems.” 2013. Web. 22 Oct 2019.

Vancouver:

Tseng C. Variants of the Constrained Longest Common and Longest Increasing Subsequence Problems. [Internet] [Doctoral dissertation]. NSYSU; 2013. [cited 2019 Oct 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720113-163337.

Council of Science Editors:

Tseng C. Variants of the Constrained Longest Common and Longest Increasing Subsequence Problems. [Doctoral Dissertation]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720113-163337


NSYSU

3. Tseng, Chiou-Ting. Finding the Longest Increasing Subsequence of Every Substring.

Degree: Master, Computer Science and Engineering, 2006, NSYSU

 Given a string S = {a1, a2, a3, ..., an}, the longest increasing subsequence (LIS) problem is to find a subsequence of the given string… (more)

Subjects/Keywords: longest increasing subsequence; row tower; substring; sliding window

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tseng, C. (2006). Finding the Longest Increasing Subsequence of Every Substring. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0827106-160715

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tseng, Chiou-Ting. “Finding the Longest Increasing Subsequence of Every Substring.” 2006. Thesis, NSYSU. Accessed October 22, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0827106-160715.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tseng, Chiou-Ting. “Finding the Longest Increasing Subsequence of Every Substring.” 2006. Web. 22 Oct 2019.

Vancouver:

Tseng C. Finding the Longest Increasing Subsequence of Every Substring. [Internet] [Thesis]. NSYSU; 2006. [cited 2019 Oct 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0827106-160715.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tseng C. Finding the Longest Increasing Subsequence of Every Substring. [Thesis]. NSYSU; 2006. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0827106-160715

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

4. Poddar, Anindya. Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction.

Degree: PhD, Computer Sciences, 2011, Louisiana State University

 Preprocessing of database is inevitable to extract information from large databases like biological sequences of gene or protein. Discovery of patterns becomes very time efficient… (more)

Subjects/Keywords: String; Proteome; N-gram tree; N-gram tree of text; Substring; Pattern; Genome; N-gram; Suffix Tree; Suffix Array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Poddar, A. (2011). Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-04152011-174740 ; https://digitalcommons.lsu.edu/gradschool_dissertations/490

Chicago Manual of Style (16th Edition):

Poddar, Anindya. “Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction.” 2011. Doctoral Dissertation, Louisiana State University. Accessed October 22, 2019. etd-04152011-174740 ; https://digitalcommons.lsu.edu/gradschool_dissertations/490.

MLA Handbook (7th Edition):

Poddar, Anindya. “Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction.” 2011. Web. 22 Oct 2019.

Vancouver:

Poddar A. Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction. [Internet] [Doctoral dissertation]. Louisiana State University; 2011. [cited 2019 Oct 22]. Available from: etd-04152011-174740 ; https://digitalcommons.lsu.edu/gradschool_dissertations/490.

Council of Science Editors:

Poddar A. Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction. [Doctoral Dissertation]. Louisiana State University; 2011. Available from: etd-04152011-174740 ; https://digitalcommons.lsu.edu/gradschool_dissertations/490

5. Davis, Edward C., Jr. Identification of Small Endogenous Viral Elements within Host Genomes.

Degree: 2016, Boise State University

 A parallel string matching software architecture has been developed (incorporating several algorithms) to identify small genetic sequences in large genomes. Endogenous viral elements (EVEs) are… (more)

Subjects/Keywords: seve; bioinformatics; genomics; immunology; substring; matching; Other Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Davis, Edward C., J. (2016). Identification of Small Endogenous Viral Elements within Host Genomes. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/1085

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Davis, Edward C., Jr. “Identification of Small Endogenous Viral Elements within Host Genomes.” 2016. Thesis, Boise State University. Accessed October 22, 2019. https://scholarworks.boisestate.edu/td/1085.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Davis, Edward C., Jr. “Identification of Small Endogenous Viral Elements within Host Genomes.” 2016. Web. 22 Oct 2019.

Vancouver:

Davis, Edward C. J. Identification of Small Endogenous Viral Elements within Host Genomes. [Internet] [Thesis]. Boise State University; 2016. [cited 2019 Oct 22]. Available from: https://scholarworks.boisestate.edu/td/1085.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Davis, Edward C. J. Identification of Small Endogenous Viral Elements within Host Genomes. [Thesis]. Boise State University; 2016. Available from: https://scholarworks.boisestate.edu/td/1085

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

6. Hlaváček, Pavel. Konstrukce sufixových stromů a jejich využití v bioinformatice .

Degree: 2011, Brno University of Technology

 Práce se zabývá problematikou implementace sufixových stromů a jejich využití v bioinformatice. Jsou zde uvedeny různé druhy algoritmů pro tvorbu sufixových stromů. Především se zabývá implementací… (more)

Subjects/Keywords: Sufixový strom; Ukkonen; McCreight; online metoda; řetězec; podřetězce; prefix; sufix; přibližný; odpovídající; Suffix tree; Ukkonen; McCreight; online; string; substring; preffix; suffix; approximate; matching  

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hlaváček, P. (2011). Konstrukce sufixových stromů a jejich využití v bioinformatice . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55648

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hlaváček, Pavel. “Konstrukce sufixových stromů a jejich využití v bioinformatice .” 2011. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/55648.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hlaváček, Pavel. “Konstrukce sufixových stromů a jejich využití v bioinformatice .” 2011. Web. 22 Oct 2019.

Vancouver:

Hlaváček P. Konstrukce sufixových stromů a jejich využití v bioinformatice . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/55648.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hlaváček P. Konstrukce sufixových stromů a jejich využití v bioinformatice . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/55648

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. Medeiros Vanderlei, Igor. Casamento de padrão em strings privados, com aplicação em consultas seguras a banco de dados .

Degree: 2006, Universidade Federal de Pernambuco

 A computação segura entre múltiplos participantes (MPC) é uma área de convergência entre estudos de criptografia e de sistemas distribuídos. Na MPC, assim como na… (more)

Subjects/Keywords: Criptografia; Protocolos criptográficos; MPC; Computação segura entre Múltiplos Participantes; Substring; Consulta Segura a Banco de Dados

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Medeiros Vanderlei, I. (2006). Casamento de padrão em strings privados, com aplicação em consultas seguras a banco de dados . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/2610

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Medeiros Vanderlei, Igor. “Casamento de padrão em strings privados, com aplicação em consultas seguras a banco de dados .” 2006. Thesis, Universidade Federal de Pernambuco. Accessed October 22, 2019. http://repositorio.ufpe.br/handle/123456789/2610.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Medeiros Vanderlei, Igor. “Casamento de padrão em strings privados, com aplicação em consultas seguras a banco de dados .” 2006. Web. 22 Oct 2019.

Vancouver:

Medeiros Vanderlei I. Casamento de padrão em strings privados, com aplicação em consultas seguras a banco de dados . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2006. [cited 2019 Oct 22]. Available from: http://repositorio.ufpe.br/handle/123456789/2610.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Medeiros Vanderlei I. Casamento de padrão em strings privados, com aplicação em consultas seguras a banco de dados . [Thesis]. Universidade Federal de Pernambuco; 2006. Available from: http://repositorio.ufpe.br/handle/123456789/2610

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Gilles, Fabrice. Valorisation des analogies lexicales entre l'anglais et les langues romanes : étude prospective pour un dispositif plurilingue d'apprentissage du FLE dans le domaine de la santé : Emphasising lexical analogies between English and Romance languages : prospective study towards a plurilingual learning device of French for healthcare.

Degree: Docteur es, Sciences du langage Spécialité Didactique et Linguistique, 2017, Grenoble Alpes

Cette étude lexicologique prospective s'inscrit dans la didactique des L3. L’objectif est d’élaborer un interlexique anglais-espagnol-français-italien-portugais composé des adjectifs, noms et verbes anglais fréquents dans… (more)

Subjects/Keywords: Analogies lexicales anglais - langues romanes; FOS / français de la santé; Corpus multilingues alignés; Profil combinatoire; Sous-Chaîne commune maximale (SCM); Langue passerelle; Lexical analogies (English - Romance languages); French for Specific Purposes / French for healthcare; Multilingual aligned corpora; Combinatory profile; Longest common substring; Bridge language; 448

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gilles, F. (2017). Valorisation des analogies lexicales entre l'anglais et les langues romanes : étude prospective pour un dispositif plurilingue d'apprentissage du FLE dans le domaine de la santé : Emphasising lexical analogies between English and Romance languages : prospective study towards a plurilingual learning device of French for healthcare. (Doctoral Dissertation). Grenoble Alpes. Retrieved from http://www.theses.fr/2017GREAL011

Chicago Manual of Style (16th Edition):

Gilles, Fabrice. “Valorisation des analogies lexicales entre l'anglais et les langues romanes : étude prospective pour un dispositif plurilingue d'apprentissage du FLE dans le domaine de la santé : Emphasising lexical analogies between English and Romance languages : prospective study towards a plurilingual learning device of French for healthcare.” 2017. Doctoral Dissertation, Grenoble Alpes. Accessed October 22, 2019. http://www.theses.fr/2017GREAL011.

MLA Handbook (7th Edition):

Gilles, Fabrice. “Valorisation des analogies lexicales entre l'anglais et les langues romanes : étude prospective pour un dispositif plurilingue d'apprentissage du FLE dans le domaine de la santé : Emphasising lexical analogies between English and Romance languages : prospective study towards a plurilingual learning device of French for healthcare.” 2017. Web. 22 Oct 2019.

Vancouver:

Gilles F. Valorisation des analogies lexicales entre l'anglais et les langues romanes : étude prospective pour un dispositif plurilingue d'apprentissage du FLE dans le domaine de la santé : Emphasising lexical analogies between English and Romance languages : prospective study towards a plurilingual learning device of French for healthcare. [Internet] [Doctoral dissertation]. Grenoble Alpes; 2017. [cited 2019 Oct 22]. Available from: http://www.theses.fr/2017GREAL011.

Council of Science Editors:

Gilles F. Valorisation des analogies lexicales entre l'anglais et les langues romanes : étude prospective pour un dispositif plurilingue d'apprentissage du FLE dans le domaine de la santé : Emphasising lexical analogies between English and Romance languages : prospective study towards a plurilingual learning device of French for healthcare. [Doctoral Dissertation]. Grenoble Alpes; 2017. Available from: http://www.theses.fr/2017GREAL011


University of Guelph

9. Wickland, David D. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees .

Degree: 2017, University of Guelph

 The music industry was the first mass-media industry to be transformed by the transition to digital. Today, music consumers have access to personal libraries, subscription-based… (more)

Subjects/Keywords: symbolic similarity; melodic similarity; local alignment; global alignment; music similarity; suffix tree; cover song; longest common substring; pattern matching; sequence alignment; pairwise; exact matching; inexact matching; approximate matching; string matching; music information retrieval; MIR

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wickland, D. D. (2017). Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wickland, David D. “Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees .” 2017. Thesis, University of Guelph. Accessed October 22, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wickland, David D. “Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees .” 2017. Web. 22 Oct 2019.

Vancouver:

Wickland DD. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees . [Internet] [Thesis]. University of Guelph; 2017. [cited 2019 Oct 22]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wickland DD. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees . [Thesis]. University of Guelph; 2017. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.