Index of /resource/paper/team/huangcm101

[ICO]NameLast modifiedSizeDescription
[PARENTDIR]Parent Directory  -  
[ ]A Robust Model for Finding Optimal Evolutionary Trees.doc2013-05-28 04:42 238K 
[ ]A Versatile Divide and Conquer Technique for Optimal String Alignment.doc2013-05-28 04:42 128K 
[ ]An Information Based Sequence Distance and Its Application to Whole Mitochondrial Genome Phylogeny.doc2013-05-28 04:42 47K 
[ ]Fast Nearest Neighbor Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System.doc2013-05-28 04:42 162K 
[ ]Fibonacci Cubes-A New Interconnection Topology.doc2013-05-28 04:42 139K 
[ ]Improving the practical Space and Time Efficiency of the Shortest-Paths Approach to SP Multiple Sequence.doc2013-05-28 04:42 82K 
[ ]MSA.doc2013-05-28 04:42 82K 
[ ]Macro-Star Networks, Efficient Low-Degree Alternatives to Star Graphs.doc2013-05-28 04:42 334K 
[ ]Multiple protein sequence alignment using double-dynamic programming.doc2013-05-28 04:42 172K 
[ ]New Approximation Algorithms for Longest Common Subsequences(Extended Abstract).doc2013-05-28 04:42 21K 
[ ]On the Approximability of Numerical Taxonomy.doc2013-05-28 04:42 38K 
[ ]On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees.doc2013-05-28 04:42 37K 
[ ]On the Sizes of Extended Fibonacci Cubes.doc2013-05-28 04:42 407K 
[ ]Optically Interconnected Processor Array with Switching Capability.doc2013-05-28 04:42 140K 
[ ]Randomized Initialization Protocols for Packet Radio Networks.doc2013-05-28 04:42 153K 
[ ]The Evolution Trees.doc2013-05-28 04:42 306K 
[ ]The Number of Standard and of Effective Multiple Alignments.doc2013-05-28 04:42 70K 
[ ]Using Traveling Salesman Problem Algorithms for Evolutionary Tree Construction.doc2013-05-28 04:42 112K 
[ ]WS_FTP.LOG2013-05-28 04:42 2.0K 
Apache/2.4.41 (Ubuntu) Server at par.cse.nsysu.edu.tw Port 80