Spelling suggestions: "subject:"[een] SEQUENCE"" "subject:"[enn] SEQUENCE""
1 |
Improved algorithm for entropic segmentation of DNA sequence /Wang, Zhenggang. January 2004 (has links)
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 56-58). Also available in electronic version. Access restricted to campus users.
|
2 |
Development and application of methods for targeted DNA sequencing of pooled samplesMusgrave-Brown, Esther January 2014 (has links)
No description available.
|
3 |
A Survey on sequence spaces.January 1992 (has links)
by Yun-ming Tang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1992. / Includes bibliographical references (leaves 92-93). / Chapter Chapter 1 --- Sequence Spaces / Chapter 1.1 --- Sequence spaces --- p.1 / Chapter 1.2 --- "Duality theorems on <λ, λX>" --- p.6 / Chapter 1.3 --- Topological properties of sequence spaces --- p.30 / Chapter 1.4 --- Diagonal maps --- p.41 / Chapter Chapter 2 --- Vector sequence spaces / Chapter 2.1 --- λ-summability of vector sequences --- p.48 / Chapter 2.2 --- "A duality theorem on <Λ(E),Λ(E)X>" --- p.62 / Chapter 2.3 --- "The topological duals of [λ[E],II(ρ,ξ)},(λ(E)(ρ,ξ)) and [ λw(E), B(ρ,ξ) ]" --- p.75 / Chapter 2.4 --- Fundamentally λ-bounded spaces --- p.86 / Reference --- p.92
|
4 |
Further development of the visual genome explorer a visual genomic comparative tool /Cheng, Kai-hong. January 2001 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 112-114).
|
5 |
Some conditions in which a sequence space fails to have the Wilansky property /Tessaro, George W., January 1999 (has links)
Thesis (Ph. D.)--Lehigh University, 1999. / Includes vita. Bibliography: leavf 21.
|
6 |
Sequence spaces defined by modulus functions and superposition operators /Raidjõe, Annemai, January 2006 (has links) (PDF)
Thesis (doctoral)--University of Tartu, 2006. / This dissertation is based on 5 papers. Includes bibliographical references
|
7 |
Sequential space methodsKremsater, Terry Philip January 1972 (has links)
The class of sequential spaces and its successive smaller subclasses, the Fréchet spaces and the first-countable spaces, have topologies which are completely specified by their convergent sequences. Because sequences have many advantages over nets, these topological spaces are of interest. Special attention is paid to those properties of first-countable spaces which can or cannot be generalized to Fréchet or sequential spaces. For example, countable compactness and sequential compactness are equivalent in the larger class of sequential spaces. On the other hand, a Fréchet space with unique sequential limits need not be Hausdorff, and there is a product of two Fréchet spaces which is not sequential. Some of the more difficult problems are connected with products. The topological product of an arbitrary sequential space and a T₃
(regular and T₁) sequential space X is sequential if and only if
X is locally countably compact. There are also several results which demonstrate the non-productive nature of Fréchet spaces.
The sequential spaces and the Fréchet spaces are precisely the quotients and continuous pseudo-open images, respectively, of either (ordered) metric spaces or (ordered) first-countable spaces. These characterizations follow from those of the generalized sequential spaces and the generalized Fréchet spaces. The notions
of convergence subbasis and convergence basis play an important role here. Quotient spaces are characterized in terms of convergence subbases, and continuous pseudo-open images in terms of
convergence bases. The equivalence of hereditarily quotient maps The class of sequential spaces and its successive smaller subclasses, the Fréchet spaces and the first-countable spaces, have topologies which are completely specified by their convergent sequences. Because sequences have many advantages over nets, these topological spaces are of interest. Special attention is paid to those properties of first-countable spaces which can or cannot be generalized to Fréchet or sequential spaces. For example, countable compactness and sequential compactness are equivalent in the larger class of sequential spaces. On the other hand, a Fréchet space with unique sequential limits need not be Hausdorff, and there is a product of two Fréchet spaces which is not sequential. Some of the more difficult problems are connected with products. The topological product of an arbitrary sequential space and a T₃
(regular and T₁) sequential space X is sequential if and only if
X is locally countably compact. There are also several results which demonstrate the non-productive nature of Fréchet spaces.
The sequential spaces and the Fréchet spaces are precisely the quotients and continuous pseudo-open images, respectively, of either (ordered) metric spaces or (ordered) first-countable spaces. These characterizations follow from those of the generalized sequential spaces and the generalized Fréchet spaces. The notions
of convergence subbasis and convergence basis play an important role here. Quotient spaces are characterized in terms of conver-gence subbases, and continuous pseudo-open images in terms of
convergence bases. The equivalence of hereditarily quotient maps
and continuous pseudo-open maps implies the latter result.
and continuous pseudo-open maps implies the latter result. / Science, Faculty of / Mathematics, Department of / Graduate
|
8 |
An Interactive System for Sequence AnalysisChen, Xiangdong 05 1900 (has links)
Sequence Analysis Tool (SAT) is an X-window (OPEN LOOK version) based interactive system developed for sequence analysis. In this first version, it provides a friendly graphical user interface and convenient functions for performing various tasks required in sequence alignment. In particular, space-efficient algorithms for pairwise alignment and 3-star alignment are implemented as functionalities, which can be used to serve most sequence alignment tasks and therefore provide a basis for further improvement of this tool. SAT is also targeted at providing a testing platform for performance analysis of various alignment-related algorithms. A set of procedures is developed to provide an application programming interface with which other related programs can be easily connected to SAT. SAT is programmed in C/Xlib/OLIT. The object-oriented style makes further maintenance and improvement easy. / Thesis / Master of Science (MSc)
|
9 |
Algorithms for string matching with applications in molecular biology /Holloway, James Lee. January 1992 (has links)
Thesis (Ph. D.)--Oregon State University, 1993. / Typescript (photocopy). Includes bibliographical references (leaves 173-193). Also available on the World Wide Web.
|
10 |
A computational estimation of errors in model genomes using exactly duplicated DNA sequences /Siu, Kim-Man. January 2005 (has links)
Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2005. / Includes bibliographical references (leaves 41-43). Also available in electronic version.
|
Page generated in 0.0629 seconds