| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 9 of 9
reviews
|
|
|
 |
|
|
|
|
 ReCombinatorics: the algorithmics of ancestral recombination graphs and explicit phylogenetic networks
Gusfield D., The MIT Press, Cambridge, MA, 2014. 600 pp. Type: Book (978-0-262027-52-6)
The primary objective in the area of phylogenetic trees is to construct a tree where leaf nodes represent extant species, internal nodes represent (possibly hypothesized) ancestors, and edges represent relationships between species. Th...
|
Jan 8 2015 |
|
|
|
|
|
|
Combinatorial optimization: theory and algorithms (5th ed.)
Korte B., Vygen J., Springer Publishing Company, Incorporated, New York, NY, 2012. 678 pp. Type: Book (978-3-642244-87-2)
Combinatorial optimization encompasses the methods, theorems, and algorithms for finding optimal solutions to discrete problems. The most elementary examples include flows in networks and scheduling jobs on various machines. But the fi...
|
Aug 28 2012 |
|
|
|
|
|
|
Analytic combinatorics
Flajolet P., Sedgewick R., Cambridge University Press, New York, NY, 2009. 824 pp. Type: Book (9780521898065)
This book is an encyclopedic treatment of the mathematics known as analytic combinatorics. Analytic combinatorics is a combination of enumerative combinatorics and the art and science of approximation. The goal of enumerative combinato...
|
May 20 2009 |
|
|
|
|
|
|
The practical subtleties of biometric key generation
Ballard L., Kamara S., Reiter M. SS 2008 (Proceedings of the 17th Security Symposium, San Jose, CA, Jul 28-Aug 1, 2008) 61-74, 2008. Type: Proceedings
A biometric key generation system is a system where a biometric--for example, a fingerprint or an iris code--is coded and stored as a template, at an enrollment stage. When a user presents himself again, the biometric...
|
Mar 18 2009 |
|
|
|
|
|
|
The practical subtleties of biometric key generation
Ballard L., Kamara S., Reiter M. SS 2008 (Proceedings of the 17th Security Symposium, San Jose, CA, Jul 28-Aug 1, 2008) 61-74, 2008. Type: Proceedings
A biometric key generation system is a system where a biometric--for example, a fingerprint or an iris code--is coded and stored as a template, at an enrollment stage. When a user presents himself again, the biometric...
|
Mar 18 2009 |
|
|
|
|
|
|
Enhanced Interval Trees for Dynamic IP Router-Tables
Lu H., Sahni S. IEEE Transactions on Computers 53(12): 1615-1628, 2004. Type: Article
An approach to the problem of representing dynamic Internet protocol (IP) router tables is proposed in this paper. When packets arrive at an Internet router, certain actions may be performed on them; for example, a packet may be forwar...
|
Jul 1 2005 |
|
|
|
|
|
|
Maximum likelihood on four taxa phylogenetic trees: analytic solutions
Chor B., Khetan A., Snir S. Computational molecular biology (Proceedings of the seventh annual international conference, Berlin, Germany, Apr 10-14, 2003) 76-83, 2003. Type: Proceedings
Maximum likelihood is a well-known technique for determining phylogenetic trees. In this paper, the authors consider maximum likelihood as a constrained optimization problem, and explore techniques for solving it on four taxa, two stat...
|
May 28 2003 |
|
|
|
|
|
|
The distributions of the entries of Young tableaux
McKay B., Morse J., Wilf H. Journal of Combinatorial Theory Series A 97(1): 117-128, 2002. Type: Article
A number of probabilistic results about Young tableaux are proved in this paper. Given a partition &lgr; of n, with parts &lgr;1 + &lgr;2 + ... + &lgr;t = n<...
|
Feb 13 2003 |
|
|
|
|
|
|
Generalized parking functions, tree inversions, and multicolored graphs
Yan C. Advances in Applied Mathematics 27(2-3): 641-670, 2001. Type: Article
The author presents a generalization of parking functions, and derives a number of bijections for them. Parking functions are related to hashing and linear probing, and can be defined in terms of n cars attempting t...
|
Nov 6 2002 |
|
|
|
|
|
| |
|
|
| |
|
|
