dc.date.accessioned | 2016-12-27T21:48:55Z | |
dc.date.accessioned | 2018-06-13T23:04:11Z | |
dc.date.available | 2016-12-27T21:48:55Z | |
dc.date.available | 2018-06-13T23:04:11Z | |
dc.date.created | 2016-12-27T21:48:55Z | |
dc.date.issued | 1999 | |
dc.identifier | 0-7695-0268-7 | |
dc.identifier | http://hdl.handle.net/10533/165078 | |
dc.identifier | 1990627 | |
dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1543880 | |
dc.description.abstract | We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time.We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. We provide a detailed average case
analysis which shows that the running time of the algorithm is
subquadratic with respect to the database size. A similar algorithm
solves the approximate string matching problem in sublinear average time. | |
dc.language | eng | |
dc.publisher | IEEE TECHNICAL COMMITTEE ON DATA ENGINEERING | |
dc.relation | info:eu-repo/grantAgreement/Fondecyt/1990627 | |
dc.relation | info:eu-repo/semantics/dataset/hdl.handle.net/10533/93479 | |
dc.relation | instname: Conicyt | |
dc.relation | reponame: Repositorio Digital RI2.0 | |
dc.relation | instname: Conicyt | |
dc.relation | reponame: Repositorio Digital RI 2.0 | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.title | A FAST ALGORITHM ON AVERAGE FOR ALL-AGAINST-ALL SEQUENCE MATCHING | |
dc.type | Capitulo de libro | |