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:( Suffix tree algorithm). Showing records 1 – 30 of 10010 total matches.

[1] [2] [3] [4] [5] … [334]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


Brno University of Technology

1. Klouba, Lukáš. Celogenomové zarovnání pomocí suffixových stromů .

Degree: 2017, Brno University of Technology

 Cílem této práce je vytvořit algoritmus, který pomocí sufixových konstrukcí umožní zarovnání genomu dvou organismů, a implementovat jej do programového prostředí jazyka R. Práce se… (more)

Subjects/Keywords: sufixové stromy; sufixová pole; Ukkonenův algoritmus; R; celogenomové zarovnání; suffix tree; suffix array; Ukkonen’s algorithm; R; whole-genome alignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Klouba, L. (2017). Celogenomové zarovnání pomocí suffixových stromů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/65466

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):

Klouba, Lukáš. “Celogenomové zarovnání pomocí suffixových stromů .” 2017. Thesis, Brno University of Technology. Accessed September 22, 2019. http://hdl.handle.net/11012/65466.

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

MLA Handbook (7th Edition):

Klouba, Lukáš. “Celogenomové zarovnání pomocí suffixových stromů .” 2017. Web. 22 Sep 2019.

Vancouver:

Klouba L. Celogenomové zarovnání pomocí suffixových stromů . [Internet] [Thesis]. Brno University of Technology; 2017. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/11012/65466.

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

Council of Science Editors:

Klouba L. Celogenomové zarovnání pomocí suffixových stromů . [Thesis]. Brno University of Technology; 2017. Available from: http://hdl.handle.net/11012/65466

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


Indian Institute of Science

2. Bhavsar, Rajul D. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.

Degree: 2011, Indian Institute of Science

 Over the last decade, biological sequence repositories have been growing at an exponential rate. Sophisticated indexing techniques are required to facilitate efficient searching through these… (more)

Subjects/Keywords: Suffix-Tree; Suffix-tree Indexing; Disk-based Suffix-trees; Suffix-tree Internal Nodes; Suffix Trees - Storage Optimization; Suffix-tree Layouts; Suffix-Tree Nodes; Disk-resident Suffix-trees; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhavsar, R. D. (2011). Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2124

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):

Bhavsar, Rajul D. “Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.” 2011. Thesis, Indian Institute of Science. Accessed September 22, 2019. http://hdl.handle.net/2005/2124.

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

MLA Handbook (7th Edition):

Bhavsar, Rajul D. “Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.” 2011. Web. 22 Sep 2019.

Vancouver:

Bhavsar RD. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. [Internet] [Thesis]. Indian Institute of Science; 2011. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/2005/2124.

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

Council of Science Editors:

Bhavsar RD. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. [Thesis]. Indian Institute of Science; 2011. Available from: http://hdl.handle.net/2005/2124

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


Indian Institute of Science

3. Bhavsar, Rajul D. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.

Degree: 2011, Indian Institute of Science

 Over the last decade, biological sequence repositories have been growing at an exponential rate. Sophisticated indexing techniques are required to facilitate efficient searching through these… (more)

Subjects/Keywords: Suffix-Tree; Suffix-tree Indexing; Disk-based Suffix-trees; Suffix-tree Internal Nodes; Suffix Trees - Storage Optimization; Suffix-tree Layouts; Suffix-Tree Nodes; Disk-resident Suffix-trees; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhavsar, R. D. (2011). Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2124 ; http://etd.ncsi.iisc.ernet.in/abstracts/2728/G24897-Abs.pdf

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):

Bhavsar, Rajul D. “Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.” 2011. Thesis, Indian Institute of Science. Accessed September 22, 2019. http://etd.iisc.ernet.in/handle/2005/2124 ; http://etd.ncsi.iisc.ernet.in/abstracts/2728/G24897-Abs.pdf.

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

MLA Handbook (7th Edition):

Bhavsar, Rajul D. “Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.” 2011. Web. 22 Sep 2019.

Vancouver:

Bhavsar RD. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. [Internet] [Thesis]. Indian Institute of Science; 2011. [cited 2019 Sep 22]. Available from: http://etd.iisc.ernet.in/handle/2005/2124 ; http://etd.ncsi.iisc.ernet.in/abstracts/2728/G24897-Abs.pdf.

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

Council of Science Editors:

Bhavsar RD. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. [Thesis]. Indian Institute of Science; 2011. Available from: http://etd.iisc.ernet.in/handle/2005/2124 ; http://etd.ncsi.iisc.ernet.in/abstracts/2728/G24897-Abs.pdf

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


University of Manitoba

4. Devanarayana, Chamara. Spectrum access in cognitive radio networks based on prediction and estimation.

Degree: Electrical and Computer Engineering, 2015, University of Manitoba

 In the literature, Cognitive radio (CR) as well as full-duplex (FD) communication technologies are proposed to increase the spectrum efficiency. The main contribution of this… (more)

Subjects/Keywords: Cognitive Radio; Overlay networks; Underlay networks; Prediction and estimation; Probabilistic suffix tree algorithm; Monotonic optimization; Resource allocation; D2D

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Devanarayana, C. (2015). Spectrum access in cognitive radio networks based on prediction and estimation. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/31605

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):

Devanarayana, Chamara. “Spectrum access in cognitive radio networks based on prediction and estimation.” 2015. Thesis, University of Manitoba. Accessed September 22, 2019. http://hdl.handle.net/1993/31605.

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

MLA Handbook (7th Edition):

Devanarayana, Chamara. “Spectrum access in cognitive radio networks based on prediction and estimation.” 2015. Web. 22 Sep 2019.

Vancouver:

Devanarayana C. Spectrum access in cognitive radio networks based on prediction and estimation. [Internet] [Thesis]. University of Manitoba; 2015. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1993/31605.

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

Council of Science Editors:

Devanarayana C. Spectrum access in cognitive radio networks based on prediction and estimation. [Thesis]. University of Manitoba; 2015. Available from: http://hdl.handle.net/1993/31605

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


Louisiana State University

5. Satish, Umesh Chandra. Parallel Suffix Tree Construction for Genome Sequence Using Hadoop.

Degree: MSCS, Computer Sciences, 2013, Louisiana State University

 Indexing the genome is the basis for many of the bioinformatics applications. Read mapping (sequence alignment) is one such application to align millions of short… (more)

Subjects/Keywords: Ukkonnen Suffix Tree; Map-Reduce based Suffix tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Satish, U. C. (2013). Parallel Suffix Tree Construction for Genome Sequence Using Hadoop. (Masters Thesis). Louisiana State University. Retrieved from etd-08122013-104039 ; https://digitalcommons.lsu.edu/gradschool_theses/1665

Chicago Manual of Style (16th Edition):

Satish, Umesh Chandra. “Parallel Suffix Tree Construction for Genome Sequence Using Hadoop.” 2013. Masters Thesis, Louisiana State University. Accessed September 22, 2019. etd-08122013-104039 ; https://digitalcommons.lsu.edu/gradschool_theses/1665.

MLA Handbook (7th Edition):

Satish, Umesh Chandra. “Parallel Suffix Tree Construction for Genome Sequence Using Hadoop.” 2013. Web. 22 Sep 2019.

Vancouver:

Satish UC. Parallel Suffix Tree Construction for Genome Sequence Using Hadoop. [Internet] [Masters thesis]. Louisiana State University; 2013. [cited 2019 Sep 22]. Available from: etd-08122013-104039 ; https://digitalcommons.lsu.edu/gradschool_theses/1665.

Council of Science Editors:

Satish UC. Parallel Suffix Tree Construction for Genome Sequence Using Hadoop. [Masters Thesis]. Louisiana State University; 2013. Available from: etd-08122013-104039 ; https://digitalcommons.lsu.edu/gradschool_theses/1665


Louisiana State University

6. 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 September 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 Sep 2019.

Vancouver:

Poddar A. Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction. [Internet] [Doctoral dissertation]. Louisiana State University; 2011. [cited 2019 Sep 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


Georgia Tech

7. Flick, Patrick. Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems.

Degree: PhD, Computational Science and Engineering, 2019, Georgia Tech

 Methods for processing and analyzing DNA and genomic data are built upon combinatorial graph and string algorithms. The advent of high-throughput DNA sequencing is enabling… (more)

Subjects/Keywords: distributed memory; suffix array; suffix tree; enhanced suffix arrays; de bruijn graphs; distributed graphs; connected components

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Flick, P. (2019). Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61257

Chicago Manual of Style (16th Edition):

Flick, Patrick. “Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems.” 2019. Doctoral Dissertation, Georgia Tech. Accessed September 22, 2019. http://hdl.handle.net/1853/61257.

MLA Handbook (7th Edition):

Flick, Patrick. “Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems.” 2019. Web. 22 Sep 2019.

Vancouver:

Flick P. Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1853/61257.

Council of Science Editors:

Flick P. Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61257


Washington State University

8. [No author]. SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE .

Degree: 2015, Washington State University

 The field of bioinformatics and computational biology is currently experiencing a data revolution. The exciting prospect of making fundamental biological discoveries is fueling the rapid… (more)

Subjects/Keywords: Computer science; Bioinformatics; metagenomics; sequence alignment; SIMD; suffix tree; work stealing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2015). SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/5503

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):

author], [No. “SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE .” 2015. Thesis, Washington State University. Accessed September 22, 2019. http://hdl.handle.net/2376/5503.

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

MLA Handbook (7th Edition):

author], [No. “SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE .” 2015. Web. 22 Sep 2019.

Vancouver:

author] [. SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE . [Internet] [Thesis]. Washington State University; 2015. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/2376/5503.

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

Council of Science Editors:

author] [. SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE . [Thesis]. Washington State University; 2015. Available from: http://hdl.handle.net/2376/5503

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


NSYSU

9. Hu, Jen-Wei. An ACGT-Words Tree for Efficient Data Access in Genomic Databases.

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

 Genomic sequence databases, like GenBank, EMBL, are widely used by molecular biologists for homology searching. Because of the increase of the size of genomic sequence… (more)

Subjects/Keywords: DNA sequence; genomic databases; indexing; suffix tree; suffix array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, J. (2003). An ACGT-Words Tree for Efficient Data Access in Genomic Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311

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):

Hu, Jen-Wei. “An ACGT-Words Tree for Efficient Data Access in Genomic Databases.” 2003. Thesis, NSYSU. Accessed September 22, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311.

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

MLA Handbook (7th Edition):

Hu, Jen-Wei. “An ACGT-Words Tree for Efficient Data Access in Genomic Databases.” 2003. Web. 22 Sep 2019.

Vancouver:

Hu J. An ACGT-Words Tree for Efficient Data Access in Genomic Databases. [Internet] [Thesis]. NSYSU; 2003. [cited 2019 Sep 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311.

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

Council of Science Editors:

Hu J. An ACGT-Words Tree for Efficient Data Access in Genomic Databases. [Thesis]. NSYSU; 2003. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311

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


Brno University of Technology

10. Šabatka, Ondřej. Reprezentace textu a její vliv na kategorizaci .

Degree: 2010, Brno University of Technology

 Diplomová práce se zabývá strojovým zpracováním textových dat. V teoretické části jsou popsány problémy související se zpracováním přirozeného jazyka a dále jsou představeny různé způsoby… (more)

Subjects/Keywords: kategorizace; klasifikační metody; dolování z textu; TF-IDF; reprezentace textu; reprezentace textových dokumentů; N-gramy; algoritmus Sufixového stromu; categorization; classification algorithms; text mining; TF-IDF; representation of text; representation of text documents; N-grams; Suffix tree algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Šabatka, O. (2010). Reprezentace textu a její vliv na kategorizaci . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54406

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):

Šabatka, Ondřej. “Reprezentace textu a její vliv na kategorizaci .” 2010. Thesis, Brno University of Technology. Accessed September 22, 2019. http://hdl.handle.net/11012/54406.

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

MLA Handbook (7th Edition):

Šabatka, Ondřej. “Reprezentace textu a její vliv na kategorizaci .” 2010. Web. 22 Sep 2019.

Vancouver:

Šabatka O. Reprezentace textu a její vliv na kategorizaci . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/11012/54406.

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

Council of Science Editors:

Šabatka O. Reprezentace textu a její vliv na kategorizaci . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/54406

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

11. Carelo, Caio Cesar Mori. Perseus:uma nova técnica para tratar árvores de sufixo persistentes.

Degree: Mestrado, Ciências de Computação e Matemática Computacional, 2009, University of São Paulo

O avanço tecnológico dos laboratórios de biologia molecular tem proporcionado um grande aumento no volume de seqüências de nucleotídeos armazenadas em bancos de dados biológicos,… (more)

Subjects/Keywords: Árvore de sufixo; Bioinformática; Bioinformatics; Nucleotides sequence; Seqüencia de nucleotídeos; Suffix tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carelo, C. C. M. (2009). Perseus:uma nova técnica para tratar árvores de sufixo persistentes. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;

Chicago Manual of Style (16th Edition):

Carelo, Caio Cesar Mori. “Perseus:uma nova técnica para tratar árvores de sufixo persistentes.” 2009. Masters Thesis, University of São Paulo. Accessed September 22, 2019. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;.

MLA Handbook (7th Edition):

Carelo, Caio Cesar Mori. “Perseus:uma nova técnica para tratar árvores de sufixo persistentes.” 2009. Web. 22 Sep 2019.

Vancouver:

Carelo CCM. Perseus:uma nova técnica para tratar árvores de sufixo persistentes. [Internet] [Masters thesis]. University of São Paulo; 2009. [cited 2019 Sep 22]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;.

Council of Science Editors:

Carelo CCM. Perseus:uma nova técnica para tratar árvores de sufixo persistentes. [Masters Thesis]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;


NSYSU

12. Lin, Bi-Shiang. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.

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

 Given two sequences A and B of lengths m and n, respectively, the consecutive suffix alignment problem is to compute the longest common subsequence (LCS)… (more)

Subjects/Keywords: S-table; linear space; consecutive suffix alignment problem; longest common subsequence; range query; segment tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, B. (2017). The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330

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):

Lin, Bi-Shiang. “The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.” 2017. Thesis, NSYSU. Accessed September 22, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330.

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

MLA Handbook (7th Edition):

Lin, Bi-Shiang. “The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.” 2017. Web. 22 Sep 2019.

Vancouver:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 Sep 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330.

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

Council of Science Editors:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330

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


NSYSU

13. Liao, Zhi-Feng. An Efficient Algorithm for Mining Repeating Patterns.

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

 A repeating pattern is composed of identifiable elements that repeat in a predictable manner. In our real life, there are lots of applications such as… (more)

Subjects/Keywords: suffix tree; repeating pattern; fast mining of repeating patterns; data mining; repeating-pattern-index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liao, Z. (2016). An Efficient Algorithm for Mining Repeating Patterns. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911

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):

Liao, Zhi-Feng. “An Efficient Algorithm for Mining Repeating Patterns.” 2016. Thesis, NSYSU. Accessed September 22, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911.

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

MLA Handbook (7th Edition):

Liao, Zhi-Feng. “An Efficient Algorithm for Mining Repeating Patterns.” 2016. Web. 22 Sep 2019.

Vancouver:

Liao Z. An Efficient Algorithm for Mining Repeating Patterns. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Sep 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911.

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

Council of Science Editors:

Liao Z. An Efficient Algorithm for Mining Repeating Patterns. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911

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


Louisiana State University

14. Kondikoppa, Praveenkumar. Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis.

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

 Analysis of Big data to gain better insights has been the focus of researchers in the recent past. Traditional desktop computers or database management systems… (more)

Subjects/Keywords: MapReduce; Hadoop; Scheduler; Suffix Tree; Distributed Computing; Indexing; Genome; Parallel; Assembler; Apache Giraph; Pregel; PGA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kondikoppa, P. (2014). Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07092014-152032 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3687

Chicago Manual of Style (16th Edition):

Kondikoppa, Praveenkumar. “Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis.” 2014. Doctoral Dissertation, Louisiana State University. Accessed September 22, 2019. etd-07092014-152032 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3687.

MLA Handbook (7th Edition):

Kondikoppa, Praveenkumar. “Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis.” 2014. Web. 22 Sep 2019.

Vancouver:

Kondikoppa P. Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2019 Sep 22]. Available from: etd-07092014-152032 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3687.

Council of Science Editors:

Kondikoppa P. Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis. [Doctoral Dissertation]. Louisiana State University; 2014. Available from: etd-07092014-152032 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3687


Brno University of Technology

15. 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 September 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 Sep 2019.

Vancouver:

Hlaváček P. Konstrukce sufixových stromů a jejich využití v bioinformatice . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Sep 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


Universidad de Chile

16. Abeliuk Kimelman, Andrés Jonathan. Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos .

Degree: 2012, Universidad de Chile

 El árbol de sufijos es una de las estructuras más importantes que se han creado para el manejo de cadenas de caracteres. Esta estructura permite… (more)

Subjects/Keywords: Computación; Compresión de datos (Ciencia de la Computación); Estructuras de datos (Ciencias de la Computación); Suffix tree; Estructuras compactas

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abeliuk Kimelman, A. J. (2012). Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos . (Thesis). Universidad de Chile. Retrieved from http://www.repositorio.uchile.cl/handle/2250/104369

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):

Abeliuk Kimelman, Andrés Jonathan. “Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos .” 2012. Thesis, Universidad de Chile. Accessed September 22, 2019. http://www.repositorio.uchile.cl/handle/2250/104369.

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

MLA Handbook (7th Edition):

Abeliuk Kimelman, Andrés Jonathan. “Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos .” 2012. Web. 22 Sep 2019.

Vancouver:

Abeliuk Kimelman AJ. Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos . [Internet] [Thesis]. Universidad de Chile; 2012. [cited 2019 Sep 22]. Available from: http://www.repositorio.uchile.cl/handle/2250/104369.

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

Council of Science Editors:

Abeliuk Kimelman AJ. Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos . [Thesis]. Universidad de Chile; 2012. Available from: http://www.repositorio.uchile.cl/handle/2250/104369

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

17. WONG SWEE SEONG. String matching and indexing with suffix data structures.

Degree: 2008, National University of Singapore

Subjects/Keywords: suffix tree; suffix array; compressed suffix data structures; string indexing; string matching; sequence alignment search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SEONG, W. S. (2008). String matching and indexing with suffix data structures. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13083

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):

SEONG, WONG SWEE. “String matching and indexing with suffix data structures.” 2008. Thesis, National University of Singapore. Accessed September 22, 2019. http://scholarbank.nus.edu.sg/handle/10635/13083.

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

MLA Handbook (7th Edition):

SEONG, WONG SWEE. “String matching and indexing with suffix data structures.” 2008. Web. 22 Sep 2019.

Vancouver:

SEONG WS. String matching and indexing with suffix data structures. [Internet] [Thesis]. National University of Singapore; 2008. [cited 2019 Sep 22]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13083.

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

Council of Science Editors:

SEONG WS. String matching and indexing with suffix data structures. [Thesis]. National University of Singapore; 2008. Available from: http://scholarbank.nus.edu.sg/handle/10635/13083

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


Universiteit Utrecht

18. Eeden, J.G. van. Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm.

Degree: 2015, Universiteit Utrecht

 In the ongoing strive to reach human-level intelligence with intelligent agents, it has become clear that the agents should be able to deal with a… (more)

Subjects/Keywords: Monte Carlo Tree Search; MCTS; AI; Artificial Intelligence; algorithm; tree search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Eeden, J. G. v. (2015). Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/315915

Chicago Manual of Style (16th Edition):

Eeden, J G van. “Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm.” 2015. Masters Thesis, Universiteit Utrecht. Accessed September 22, 2019. http://dspace.library.uu.nl:8080/handle/1874/315915.

MLA Handbook (7th Edition):

Eeden, J G van. “Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm.” 2015. Web. 22 Sep 2019.

Vancouver:

Eeden JGv. Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Sep 22]. Available from: http://dspace.library.uu.nl:8080/handle/1874/315915.

Council of Science Editors:

Eeden JGv. Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/315915

19. Hossain, Mohammad Forhad. Spanning Tree Approach On The Snow Cleaning Problem.

Degree: Computer Engineering, 2010, Dalarna University

  Snow cleaning is one of the important tasks in the winter time in Sweden. Every year government spends huge amount money for snow cleaning… (more)

Subjects/Keywords: Snow Cleaning; Minimum Spanning Tree; Heuristic; prim’s algorithm; Greedy Algorithm.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hossain, M. F. (2010). Spanning Tree Approach On The Snow Cleaning Problem. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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):

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Thesis, Dalarna University. Accessed September 22, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

MLA Handbook (7th Edition):

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Web. 22 Sep 2019.

Vancouver:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Internet] [Thesis]. Dalarna University; 2010. [cited 2019 Sep 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

Council of Science Editors:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Thesis]. Dalarna University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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

20. Soares Neto, Domingos. Filtros para a busca e extração de padrões aproximados em cadeias biológicas.

Degree: Mestrado, Ciência da Computação, 2008, University of São Paulo

Esta dissertação de mestrado aborda formulações computacionais e algoritmos para a busca e extração de padrões em cadeias biológicas. Em particular, o presente texto concentra-se… (more)

Subjects/Keywords: algoritmos bit-paralelos; algoritmos de filtragem; approximate string matching; árvores dos sufixos; bit-parallel algorithms; busca aproximada de padrões; extração de padrões; filter algorithms; motifs; motifs; patterns extraction; q-gramas; q-grams; suffix array; suffix tree; vetor dos sufixos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soares Neto, D. (2008). Filtros para a busca e extração de padrões aproximados em cadeias biológicas. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;

Chicago Manual of Style (16th Edition):

Soares Neto, Domingos. “Filtros para a busca e extração de padrões aproximados em cadeias biológicas.” 2008. Masters Thesis, University of São Paulo. Accessed September 22, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;.

MLA Handbook (7th Edition):

Soares Neto, Domingos. “Filtros para a busca e extração de padrões aproximados em cadeias biológicas.” 2008. Web. 22 Sep 2019.

Vancouver:

Soares Neto D. Filtros para a busca e extração de padrões aproximados em cadeias biológicas. [Internet] [Masters thesis]. University of São Paulo; 2008. [cited 2019 Sep 22]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;.

Council of Science Editors:

Soares Neto D. Filtros para a busca e extração de padrões aproximados em cadeias biológicas. [Masters Thesis]. University of São Paulo; 2008. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;


Brno University of Technology

21. Divila, Jaroslav. Vyhledávání přibližných palindromů v DNA sekvencích .

Degree: 2012, Brno University of Technology

 Tato práce se zabývá návrhem a implementací nástroje pro vyhledávání přibližných palindromů v sekvencích DNA. Zaměřuje se na popis DNA struktury, významu palindromů v DNA… (more)

Subjects/Keywords: DNA; přibližné palindromy; vyhledávání palindromů; vyhledávání palindromů se smyčkou; sufixové stromy; sufixová pole; dynamické programování; vlásenky; křížové struktury; DNA; approximate palindromes; palidrome detection; stem-loop detection; suffix tree; suffix array; dynamics programming; hairpin; cruciform

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Divila, J. (2012). Vyhledávání přibližných palindromů v DNA sekvencích . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53667

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):

Divila, Jaroslav. “Vyhledávání přibližných palindromů v DNA sekvencích .” 2012. Thesis, Brno University of Technology. Accessed September 22, 2019. http://hdl.handle.net/11012/53667.

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

MLA Handbook (7th Edition):

Divila, Jaroslav. “Vyhledávání přibližných palindromů v DNA sekvencích .” 2012. Web. 22 Sep 2019.

Vancouver:

Divila J. Vyhledávání přibližných palindromů v DNA sekvencích . [Internet] [Thesis]. Brno University of Technology; 2012. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/11012/53667.

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

Council of Science Editors:

Divila J. Vyhledávání přibližných palindromů v DNA sekvencích . [Thesis]. Brno University of Technology; 2012. Available from: http://hdl.handle.net/11012/53667

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


University of Canterbury

22. Brettell, Nicholas John. Aspects of Matroid Connectivity.

Degree: School of Mathematics and Statistics, 2014, University of Canterbury

 Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in the eventual solution of many problems in matroid theory. Loosely speaking,… (more)

Subjects/Keywords: matroid theory; connectivity; chain theorem; splitter theorem; tree decomposition; k-tree; polynomial-time algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brettell, N. J. (2014). Aspects of Matroid Connectivity. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/9215

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):

Brettell, Nicholas John. “Aspects of Matroid Connectivity.” 2014. Thesis, University of Canterbury. Accessed September 22, 2019. http://hdl.handle.net/10092/9215.

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

MLA Handbook (7th Edition):

Brettell, Nicholas John. “Aspects of Matroid Connectivity.” 2014. Web. 22 Sep 2019.

Vancouver:

Brettell NJ. Aspects of Matroid Connectivity. [Internet] [Thesis]. University of Canterbury; 2014. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/10092/9215.

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

Council of Science Editors:

Brettell NJ. Aspects of Matroid Connectivity. [Thesis]. University of Canterbury; 2014. Available from: http://hdl.handle.net/10092/9215

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


Delft University of Technology

23. De Bokx, R. Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:.

Degree: 2015, Delft University of Technology

 The recently introduced Linkage Tree Genetic Algorithm (LTGA) has shown to exhibit excellent scalability on a variety of optimization problems. LTGA employs Linkage Trees (LTs)… (more)

Subjects/Keywords: parallel; optimization; modeling; LTGA; Linkage Tree; Linkage Tree Genetic Algorithm; model optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

De Bokx, R. (2015). Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6cf6c908-0f5d-4096-b3ad-aa96fd1ff382

Chicago Manual of Style (16th Edition):

De Bokx, R. “Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:.” 2015. Masters Thesis, Delft University of Technology. Accessed September 22, 2019. http://resolver.tudelft.nl/uuid:6cf6c908-0f5d-4096-b3ad-aa96fd1ff382.

MLA Handbook (7th Edition):

De Bokx, R. “Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:.” 2015. Web. 22 Sep 2019.

Vancouver:

De Bokx R. Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Sep 22]. Available from: http://resolver.tudelft.nl/uuid:6cf6c908-0f5d-4096-b3ad-aa96fd1ff382.

Council of Science Editors:

De Bokx R. Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:6cf6c908-0f5d-4096-b3ad-aa96fd1ff382


Universidade Nova

24. Costa, Jorge André Nogueira da. Time and Space Efficient Data Structures for Supporting Machine Translation Tasks.

Degree: 2017, Universidade Nova

 The amount of digital natural language text collections available nowadays is huge and it has been growing at an exponential rate. All this information can… (more)

Subjects/Keywords: Bilingual texts; Byte-codesWavelet Tree; Suffix Array; Machine Translation; Bilingual Framework; bilingual search; Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Costa, J. A. N. d. (2017). Time and Space Efficient Data Structures for Supporting Machine Translation Tasks. (Thesis). Universidade Nova. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929

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):

Costa, Jorge André Nogueira da. “Time and Space Efficient Data Structures for Supporting Machine Translation Tasks.” 2017. Thesis, Universidade Nova. Accessed September 22, 2019. https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929.

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

MLA Handbook (7th Edition):

Costa, Jorge André Nogueira da. “Time and Space Efficient Data Structures for Supporting Machine Translation Tasks.” 2017. Web. 22 Sep 2019.

Vancouver:

Costa JANd. Time and Space Efficient Data Structures for Supporting Machine Translation Tasks. [Internet] [Thesis]. Universidade Nova; 2017. [cited 2019 Sep 22]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929.

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

Council of Science Editors:

Costa JANd. Time and Space Efficient Data Structures for Supporting Machine Translation Tasks. [Thesis]. Universidade Nova; 2017. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929

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


Brno University of Technology

25. Remiáš, Richard. Vyhledávání přibližných palindromů v DNA sekvencích .

Degree: 2010, Brno University of Technology

 Práca sa zaoberá problematikou vyhľadávania presných a približných palindrómov. V súvislosti s vyhľadávaním presných palindrómov analyzuje naivný postup vyhľadávania ako aj postupy založené na sufixových… (more)

Subjects/Keywords: Palindrom; přibližný palindrom;  přesný palindrom; vyhledávání palindromů; sufixový strom;  dynamické programování.; Palindrome; approximate palindrome; exact palindrome; palindrome searching; suffix tree; dynamic programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Remiáš, R. (2010). Vyhledávání přibližných palindromů v DNA sekvencích . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52995

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):

Remiáš, Richard. “Vyhledávání přibližných palindromů v DNA sekvencích .” 2010. Thesis, Brno University of Technology. Accessed September 22, 2019. http://hdl.handle.net/11012/52995.

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

MLA Handbook (7th Edition):

Remiáš, Richard. “Vyhledávání přibližných palindromů v DNA sekvencích .” 2010. Web. 22 Sep 2019.

Vancouver:

Remiáš R. Vyhledávání přibližných palindromů v DNA sekvencích . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/11012/52995.

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

Council of Science Editors:

Remiáš R. Vyhledávání přibližných palindromů v DNA sekvencích . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/52995

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


Brno University of Technology

26. Angelov, Michael. Hudební improvizace .

Degree: 2009, Brno University of Technology

 Bakalářská práce sa zabývá problematikou algoritmické kompozice hudby, zejména oblastí počítačem řízené hudební improvizace. V úvodních kapitolách je uveden přehled existujícich nástrojů a přístupů nejčastěji… (more)

Subjects/Keywords: MIDI; improvizace; algoritmická kompozice hudby; počítačová hudba; prediction suffix tree; PST; markovské řetězce; MIDI; improvisation; algorithmic music composition; computer music; prediction suffix tree; PST; markov chains

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Angelov, M. (2009). Hudební improvizace . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54559

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):

Angelov, Michael. “Hudební improvizace .” 2009. Thesis, Brno University of Technology. Accessed September 22, 2019. http://hdl.handle.net/11012/54559.

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

MLA Handbook (7th Edition):

Angelov, Michael. “Hudební improvizace .” 2009. Web. 22 Sep 2019.

Vancouver:

Angelov M. Hudební improvizace . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/11012/54559.

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

Council of Science Editors:

Angelov M. Hudební improvizace . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/54559

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


Louisiana State University

27. Ding, Song. Optimal binary trees with height restrictions on left and right branches.

Degree: MS, Applied Mathematics, 2006, Louisiana State University

 We begin with background definitions on binary trees. Then we review known algorithms for finding optimal binary search trees. Knuth's famous algorithm, presented in the… (more)

Subjects/Keywords: knuth's algorithm; binary search tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ding, S. (2006). Optimal binary trees with height restrictions on left and right branches. (Masters Thesis). Louisiana State University. Retrieved from etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217

Chicago Manual of Style (16th Edition):

Ding, Song. “Optimal binary trees with height restrictions on left and right branches.” 2006. Masters Thesis, Louisiana State University. Accessed September 22, 2019. etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217.

MLA Handbook (7th Edition):

Ding, Song. “Optimal binary trees with height restrictions on left and right branches.” 2006. Web. 22 Sep 2019.

Vancouver:

Ding S. Optimal binary trees with height restrictions on left and right branches. [Internet] [Masters thesis]. Louisiana State University; 2006. [cited 2019 Sep 22]. Available from: etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217.

Council of Science Editors:

Ding S. Optimal binary trees with height restrictions on left and right branches. [Masters Thesis]. Louisiana State University; 2006. Available from: etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217


UCLA

28. Ding, Fan. Click Prediction with Machine Learning Tools.

Degree: Statistics, 2018, UCLA

 In this paper, we will explore multiple machine learning tools with their applications in the industry of advertisement technology. Companies like Sabio Mobile Inc. aim… (more)

Subjects/Keywords: Statistics; Advertising Technology; Logistic Regression; Machine Learning; Neural Network; Tree Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ding, F. (2018). Click Prediction with Machine Learning Tools. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/0cf772s3

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):

Ding, Fan. “Click Prediction with Machine Learning Tools.” 2018. Thesis, UCLA. Accessed September 22, 2019. http://www.escholarship.org/uc/item/0cf772s3.

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

MLA Handbook (7th Edition):

Ding, Fan. “Click Prediction with Machine Learning Tools.” 2018. Web. 22 Sep 2019.

Vancouver:

Ding F. Click Prediction with Machine Learning Tools. [Internet] [Thesis]. UCLA; 2018. [cited 2019 Sep 22]. Available from: http://www.escholarship.org/uc/item/0cf772s3.

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

Council of Science Editors:

Ding F. Click Prediction with Machine Learning Tools. [Thesis]. UCLA; 2018. Available from: http://www.escholarship.org/uc/item/0cf772s3

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


George Mason University

29. Roufarshbaf, Hossein. A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking .

Degree: 2011, George Mason University

 We propose complexity efficient tree search approaches to detection and estimation problems, and we consider both communication and target tracking applications in this regard. We… (more)

Subjects/Keywords: Target Tracking; Tree Search; Modulation Classification; Stack Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roufarshbaf, H. (2011). A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/6584

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):

Roufarshbaf, Hossein. “A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking .” 2011. Thesis, George Mason University. Accessed September 22, 2019. http://hdl.handle.net/1920/6584.

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

MLA Handbook (7th Edition):

Roufarshbaf, Hossein. “A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking .” 2011. Web. 22 Sep 2019.

Vancouver:

Roufarshbaf H. A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking . [Internet] [Thesis]. George Mason University; 2011. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1920/6584.

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

Council of Science Editors:

Roufarshbaf H. A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking . [Thesis]. George Mason University; 2011. Available from: http://hdl.handle.net/1920/6584

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


Kansas State University

30. Clemens, Jason. Spanning tree modulus: deflation and a hierarchical graph structure.

Degree: PhD, Department of Mathematics, 2018, Kansas State University

 The concept of discrete p-modulus provides a general framework for understanding arbitrary families of objects on a graph. The p-modulus provides a sense of ``structure''… (more)

Subjects/Keywords: Modulus; Spanning tree; Minimum spanning trees; Graph structure; Greedy algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clemens, J. (2018). Spanning tree modulus: deflation and a hierarchical graph structure. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/39115

Chicago Manual of Style (16th Edition):

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Doctoral Dissertation, Kansas State University. Accessed September 22, 2019. http://hdl.handle.net/2097/39115.

MLA Handbook (7th Edition):

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Web. 22 Sep 2019.

Vancouver:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Internet] [Doctoral dissertation]. Kansas State University; 2018. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/2097/39115.

Council of Science Editors:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Doctoral Dissertation]. Kansas State University; 2018. Available from: http://hdl.handle.net/2097/39115

[1] [2] [3] [4] [5] … [334]

.