L.T.Kou. Polynomial complete consecutive information retrieval problems. SIAM J. comput. 6, pp.67-75, 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Note on the Consecutive Ones Submatrix Problem - Hajiaghayi, Ganjali (2002) (1 citation) (Correct)
....if there exists a permutation of its rows that places the 1 s consecutive in every column. One can symmetrically define the equivalent property for rows. This problem of verifying this property has applications in computational biology [5] recognizing interval graphs [4] and file organization [7] in all of these the goal is to linearly arrange a set of objects with the constraint on the consecutiveness of objects in a class of given subsets. The problem of Consecutive Ones Property for a matrix is introduced in [6] as a special variant of Consecutive Ones Submatrix problem (COS) in which ....
L.T. Kou, Polynomial complete consecutive information retrieval problems, SIAM J. Comput. 6 (1977) 67--75.
Consecutive Ones Property - Hajiaghayi (2000) (Correct)
...., and a nonnegative integer K. QUESTION: Does there exist a sequence of elements of U , without repetition, such that the total number of blocks corresponding to all m 2 M does not exceed k (each m 2 M can appear as some blocks of its elements) Both problems have been proved NP complete by Kou [10] and have transformation from Hamiltonian Path problem. The following three problems have been proved NP complete in [11] INSTANCE: A family M of subsets of a nite set U . Question: Can M be partitioned into two families with C1P (Transformation from Undirected Hamiltonian Path with Degree at ....
L. T. Kou, \Polynomial complete consecutive information retrieval problems", SIAM J. Comput. 6(1977), 67-75.
A Note on the Consecutive Ones Submatrix Problem - Hajiaghayi, Ganjali (2002) (1 citation) (Correct)
....if there exists a permutation of its rows that places the 1 s consecutive in every column. One can symmetrically de ne the equivalent property for rows. This problem of verifying this property has applications in computational biology [5] recognizing interval graphs [4] and le organization [7] in all of these the goal is to linearly arrange a set of objects with the constraint on the consecutiveness of objects in a class of given subsets. The problem of Consecutive Ones Property for a matrix is introduced in [6] as a special variant of Consecutive Ones Submatrix problem (COS) in which ....
L. T. Kou, \Polynomial complete consecutive information retrieval problems", SIAM J. Comput. 6(1977), 67-75.
On Physical Mapping and the Consecutive Ones Property for.. - Atkins, Middendorf (1996) (1 citation) (Correct)
....Ones Problem is to determine if there exist a row reordering of a given Boolean matrix such that each column contains at most k blocks of ones. In this paper we show that the 2 Consecutive Ones Problem is NPcomplete even for sparse matrices with at most 8 ones in any row or column. Kou [16] has shown that it is an NP complete problem to determine the minimum number of column splittings (or row splittings) necessary for a given Boolean matrix to gain the Consecutive Ones Property. To split a column c means to replace it by two columns c 0 ; c 00 such that c has a one in a row r ....
L. T. Kou, Polynomial complete consecutive information retrieval problems, SIAM J. of Comput. 6 (1977), 67-75. 19
Physical Mapping by STS Hybridization: Algorithmic.. - Greenberg, Istrail (1995) (11 citations) (Correct)
....Huffman greedy algorithm: Minimizing oe 8.1. 1 Converting to TSP on the Hamming vector graph The connection between minimizing the number of blocks of ones in a matrix and solving the Traveling Salesperson Problem[15] on the hamming distance graph of the matrix has been observed by many authors[1, 24]. In [18] we abstracted this connection to what we called the vector Traveling Salesperson Problem (vTSP) We repeat the definition of vTSP here for convenience. Definition 20 [18] An instance of the vector TSP is an n vertex, vector labeled, complete, undirected graph, G = V; E; cost v ) and a ....
L. T. Kou. Polynomial complete consecutive information retrieval problems. SIAM J. Comput., 6(1):67--75, 1977.
Algorithms for Computing and Integrating Physical Maps Using.. - Jain, Myers (1997) (5 citations) (Correct)
....should be a 1) and chimeras (i.e. two distinct intervals reported as one) Under these more realistic assumptions, the problem becomes one of finding the most likely permutation and set of error corrections that give D the consecutive ones property. Unfortunately, this problem is NP complete [Kou77, GKS94] Let be a permutation of probes, D be the permuted incidence matrix D, and T be the corrected version of D that reflects the error corrections made in D to explain . Further suppose that one has Dept. of Computer Science, University of Arizona, Tucson, AZ 85721 (e mail: ....
Lawrence T. Kou. Polynomial complete consecutive information retrieval problems. SIAM Journal on Computing, 6(1):67--75, March 1977.
Consecutive ones Block for Symmetric Matrices Rui Wang.. - Department Of Computer (2003) (Correct)
No context found.
L.T.Kou. Polynomial complete consecutive information retrieval problems. SIAM J. comput. 6, pp.67-75, 1977.
Consecutive ones Block for Symmetric Matrices - Wang, Lau (2003) (Correct)
No context found.
L.T.Kou. Polynomial complete consecutive information retrieval problems. SIAM J. comput. 6, pp.67-75, 1977.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC