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:(longest increasing subsequence). Showing records 1 – 5 of 5 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Delaware

1. Jin, Ke. On the length of the longest common subsequence of two independent Mallows permutations .

Degree: 2017, University of Delaware

 The Mallows measure is a probability measure on Sn where the probability of a permutation π is proportional to q l(π) with q > 0… (more)

Subjects/Keywords: Applied sciences; Longest common subsequence; Longest increasing subsequence; Mallows permutation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jin, K. (2017). On the length of the longest common subsequence of two independent Mallows permutations . (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/22612

Chicago Manual of Style (16th Edition):

Jin, Ke. “On the length of the longest common subsequence of two independent Mallows permutations .” 2017. Doctoral Dissertation, University of Delaware. Accessed November 13, 2019. http://udspace.udel.edu/handle/19716/22612.

MLA Handbook (7th Edition):

Jin, Ke. “On the length of the longest common subsequence of two independent Mallows permutations .” 2017. Web. 13 Nov 2019.

Vancouver:

Jin K. On the length of the longest common subsequence of two independent Mallows permutations . [Internet] [Doctoral dissertation]. University of Delaware; 2017. [cited 2019 Nov 13]. Available from: http://udspace.udel.edu/handle/19716/22612.

Council of Science Editors:

Jin K. On the length of the longest common subsequence of two independent Mallows permutations . [Doctoral Dissertation]. University of Delaware; 2017. Available from: http://udspace.udel.edu/handle/19716/22612


NSYSU

2. Lo, Shou-Fu. A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem.

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

 The longest common increasing subsequencesã(LCIS) problem is to find out a common increasing subsequence with the maximal length of two given sequences. In this thesis,… (more)

Subjects/Keywords: Van Emde Boas Tree; Longest Common Increasing Subsequence; Diagonal; Dominate; Longest Increasing Subsequence; Longest Common Subsequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lo, S. (2018). A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-163508

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

Lo, Shou-Fu. “A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem.” 2018. Thesis, NSYSU. Accessed November 13, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-163508.

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

MLA Handbook (7th Edition):

Lo, Shou-Fu. “A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem.” 2018. Web. 13 Nov 2019.

Vancouver:

Lo S. A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem. [Internet] [Thesis]. NSYSU; 2018. [cited 2019 Nov 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-163508.

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

Council of Science Editors:

Lo S. A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-163508

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


University of Manitoba

3. Al-Meanazel, Ayat. The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets.

Degree: Statistics, 2015, University of Manitoba

 The distribution theory of runs and patterns has a long and rich history. In this dissertation we study the distribution of some run-related statistics in… (more)

Subjects/Keywords: Permutations; Multi-sets; Markov chain; Longest Increasing Subsequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-Meanazel, A. (2015). The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/30872

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

Al-Meanazel, Ayat. “The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets.” 2015. Thesis, University of Manitoba. Accessed November 13, 2019. http://hdl.handle.net/1993/30872.

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

MLA Handbook (7th Edition):

Al-Meanazel, Ayat. “The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets.” 2015. Web. 13 Nov 2019.

Vancouver:

Al-Meanazel A. The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets. [Internet] [Thesis]. University of Manitoba; 2015. [cited 2019 Nov 13]. Available from: http://hdl.handle.net/1993/30872.

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

Council of Science Editors:

Al-Meanazel A. The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets. [Thesis]. University of Manitoba; 2015. Available from: http://hdl.handle.net/1993/30872

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


NSYSU

4. 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 November 13, 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. 13 Nov 2019.

Vancouver:

Tseng C. Variants of the Constrained Longest Common and Longest Increasing Subsequence Problems. [Internet] [Doctoral dissertation]. NSYSU; 2013. [cited 2019 Nov 13]. 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

5. 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 November 13, 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. 13 Nov 2019.

Vancouver:

Tseng C. Finding the Longest Increasing Subsequence of Every Substring. [Internet] [Thesis]. NSYSU; 2006. [cited 2019 Nov 13]. 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

.